Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 8 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem | |||
WANG Hou-Zhen,ZHANG Huan-Guo, MAO Shao-Wu,WU Wan-Qing | |||
Computer Science and Technology 19 May 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract: During the last two decades, there has been intensive and fast development in the multivariate public key cryptography (MPKC), which is considered to be an important candidate for post-quantum cryptography. However, it is universally regarded as a difficult task, as in the Knapsack cryptosystems, to design a secure MPKC scheme (especially encryption scheme) employing the existing trapdoor construction. In this paper, we propose a new key exchange scheme and MPKC scheme based on the Morphism of Polynomials problem. The security of the proposed schemes is provably reducible to the conjectured intractability of a new difficult problem, namely the decisional multivariate Diffie-Hellman(DMDH) problem originated from the Morphism of Polynomials problem. The proposed key agreement is one of several non number theory based protocols, and shall be considered to be a candidate for the post-quantum era. More importantly, by slightly modifying the protocol, we offer a truly original approach to design the secure MPKC scheme. Furthermore, the proposed encryption scheme achieves a good tradeoff between security and efficiency, and seems fairly competitive in comparison with the traditional MPKC schemes. | |||
TO cite this article:WANG Hou-Zhen,ZHANG Huan-Guo, MAO Shao-Wu, et al. New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem[OL].[19 May 2016] http://en.paper.edu.cn/en_releasepaper/content/4692638 |
2. A privacy preserving method for community location sensing | |||
TAN Lei, FAN Hui-Ting, XING Kai | |||
Computer Science and Technology 07 December 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:As the advancement of network and sensing, online/mobile applications get increasing popularity. Participatory sensing provides a promising way for people to understand the world better. Many people show interest to their relative status in their community, that is, ``Where am I in my community?". In this paper, we present a technique that uses EM Algorithm to perform a Gaussian mixture model on distributed data, which controls data sharing and prevents disclosure of individual data items. We also propose a method consisting of several protocols that provide privacy preservation in participatory sensing without revealing individual's privacy information. The experiment results show that our approach can not only answer where they are in their community but also preserve their privacy. | |||
TO cite this article:TAN Lei, FAN Hui-Ting, XING Kai. A privacy preserving method for community location sensing[OL].[ 7 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4668152 |
3. Fully Simulatable Oblivious Transfer via Proof of Partial Knowledge | |||
Wei Xiao-Chao, Zhao Chuan, Jiang Han, Xu Qiu-Liang | |||
Computer Science and Technology 30 December 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract: Oblivious transfer (OT) is an important cryptographic basic tool and can be used to construct many other cryptographic scheme, such as the secure two-party computation protocol. As a sub-component of one scheme, the OT protocol must meet the security requirement of the outside scheme. For example, when constructing a secure two-party computation protocol in the presence of malicious adversary, the OT protocol used should be fully simulated in the malicious model. We propose a OT$^2_1$ protocol with full simulation under the assumption of DDH problem, relying on the notion of zero-knowledge proof of knowledge of partial (subset) Diffie-Hellman tuples. | |||
TO cite this article:Wei Xiao-Chao, Zhao Chuan, Jiang Han, et al. Fully Simulatable Oblivious Transfer via Proof of Partial Knowledge[OL].[30 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4624947 |
4. Sinkhole Attack Detection in Clustered-based Self-organizing Networks | |||
Zhang Fangjiao,ZHAI Lidong | |||
Computer Science and Technology 09 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Self-organizing networks has vast applied foreground in the future because of its low-cost, save-power, and easy implementation etc. But in such many applications, some of them place high demands on it. And safety becomes critical for wide application. Sinkhole attack is a common attack, which easily is combined with other attacks to cause more damage. In this paper, a method to detect the sinkhole attack is proposed. Two arguments are raised to help detect the nodes suffering from sinkhole attack, Credit Rating and Flow difference. | |||
TO cite this article:Zhang Fangjiao,ZHAI Lidong. Sinkhole Attack Detection in Clustered-based Self-organizing Networks[OL].[ 9 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4573922 |
5. RESEARCH OF LOSSLESS DIGITAL WATERMARKING TECHNOLOGY | |||
Sun Jianguo,KOU Liang,XIA Songzhu | |||
Computer Science and Technology 14 March 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The digital map is an important and indispensable resource to the national strategic security and social economic development. At the present, needs to focus on resolving the utility question of digital vector map copyright protection technology, furthermore, the information hiding technology is the basic content of the research areas of the digital vector maps copyright protection. It is proposed a digital copyright protection scheme, based on the principle of unauthorized cannot resume, copyright embedding operation selection partly transform for the map content. Processing area determined by the spatial clustering analysis method that is based on grid density. | |||
TO cite this article:Sun Jianguo,KOU Liang,XIA Songzhu. RESEARCH OF LOSSLESS DIGITAL WATERMARKING TECHNOLOGY[OL].[14 March 2013] http://en.paper.edu.cn/en_releasepaper/content/4526746 |
6. Characteristic Behavior Sequence Based Attack Detection Method for Browser Extension | |||
Xu Guangquan ,Junjie Wang | |||
Computer Science and Technology 08 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Browser extensions enhance the browser to help meet the varied needs of a broad user population through adding personalized features to browser. However, extensions can also expose user to disastrous attacks from the web. This paper took Firefox as an example to thoroughly study its extension mechanism and security problem, designed and implemented a monitoring system, which was depended on a behavior sequence knowledge base and used to find ongoing attacks. To show the practicality of our system, we described the characteristic behavior sequences of five typical kinds of attacks. Experiments showed that our system successfully find 11 from 18 times tentative attacks. | |||
TO cite this article:Xu Guangquan ,Junjie Wang. Characteristic Behavior Sequence Based Attack Detection Method for Browser Extension[OL].[ 8 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4506732 |
7. Some Basic Principles for Proxy Signature Schemes Based on DLP | |||
Xue Qingshui ,Li Fengying,Cao Zhenfu | |||
Computer Science and Technology 06 April 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Nowadays, most proxy signature schemes are based on the difficulty of DLP (Discrete Logarithm Problem) or ECDLP (Elliptical Curve Discrete Logarithm Problem). As though many proxy signature schemes based on DLP or ECDLP have been proposed, it makes us discouraged that some disadvantages can be found after a new or modified proxy signature scheme was designed after short time. How to solve the question? How to design secure and valid proxy signature schemes? How to prove them secure? Now, it is too difficult for us to prove one scheme secure, but if we can have some principles to conform to when designing some proxy signature schemes based on DLP or ECDLP, it will be helpful. It will be able to make scheme designers to make few mistakes, that’s to say, by these principles, they can judge whether their schemes meet these basic secure conditions or not. If designers don’t abide by these principles, it can easily be seen that their schemes are definitely insecure. It is all known that until now there are no such principles in the real life. The first principle is that the existent forms of public parameters in proxy signatures in the proxy signature verification congruence make a key role on the security property of unforgeability; the second principle is that any public parameter in the proxy signature can’t lonely exist in the proxy signature verification congruence in the form of bases or exponents; the third principle is that any public parameter in the proxy signature should exist in the proxy signature verification equation in the form of not only exponents and bases, but also hashes. About these principles, they are described. In addition, some examples are made to make them clear. | |||
TO cite this article:Xue Qingshui ,Li Fengying,Cao Zhenfu . Some Basic Principles for Proxy Signature Schemes Based on DLP[OL].[ 6 April 2010] http://en.paper.edu.cn/en_releasepaper/content/41553 |
8. An Improved Key Distribution Scheme with Self-healing and Revocation Property for Wireless Sensor Network | |||
Yanfei Zheng,Mi Wen,Kefei Chen | |||
Computer Science and Technology 03 February 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Secure group communication is one of the important secure services for the applications of wireless sensor networks because they are widely used in military as well as civilian operations. It is not very practical to assume the secure communication channels existing between group manager and each of its members just after the deployment, since most pair-wise key pre-distribution schemes in wireless sensor networks are connected with little probability. It means that it is probabilistically success for group manager and each of its members to build a secure communication channel using the pre-distributed pair-wise key at the initialization of wireless sensor networks. In this paper we propose the improved self-healing key distribution scheme which could add a strange node with coalition of t+1 group members. A so-called strange node is the node which has no secure communication channel with the group manager. We prove in an appropriate security framework that our scheme is self-healing with revocation property and extendable property under t+1 coalition. Finally, we provide a comparison in performance between our results and other existing solutions. | |||
TO cite this article:Yanfei Zheng,Mi Wen,Kefei Chen. An Improved Key Distribution Scheme with Self-healing and Revocation Property for Wireless Sensor Network[OL].[ 3 February 2008] http://en.paper.edu.cn/en_releasepaper/content/18593 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated