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 77 papers published in subject: > since this site started. |
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. Three New Approaches to Privacy-preserving Add to Multiply Protocol and Its Application | |||
Youwen Zhu,Liusheng Huang,Wei Yang,Dong Li,Yonglong Luo,Fan Dong | |||
Computer Science and Technology 30 December 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Privacy-preserving Data Mining aims at securely extracting knowledge from two or more parties’ private data. Secure Multi-party Computation is the paramount approach to it. In this paper, we study Privacy-preserving Add and Multiply Exchanging Technology and present three new different approaches to Privacy-preserving Add to Multiply Protocol. After that, we analyze and compare the three different approaches about the communication overheads, the computation efforts and the security. In addition, we extend Privacy-preserving Add to Multiply Protocol to Privacy-preserving Adding to Scalar Product Protocol, which is more secure and more useful in the high security situations of Privacy-preserving Data Mining. Meantime, we present a solution for the new protocol. | |||
TO cite this article:Youwen Zhu,Liusheng Huang,Wei Yang, et al. Three New Approaches to Privacy-preserving Add to Multiply Protocol and Its Application[OL].[30 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38300 |
2. A Novel Image-hiding Scheme Based on Quantizing Factor and Matching Factor in DWT | |||
Xiang Yong,Chen Yong | |||
Computer Science and Technology 23 November 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A novel image-hiding scheme is proposed in this paper. On the basis of analysing the correlation between the cover-image and the secret-image in DWT, by adjusting quantizing factor and matching factor, the stego-image quality and security of image hiding can be greatly improved. Experimental results show that the stego-image has a high quality , the stego-image is almost the same as the cover-image, and image-hiding scheme has a good robustness. | |||
TO cite this article:Xiang Yong,Chen Yong. A Novel Image-hiding Scheme Based on Quantizing Factor and Matching Factor in DWT[OL].[23 November 2009] http://en.paper.edu.cn/en_releasepaper/content/36924 |
3. Efficient Pairing Computation on Elliptic Curves in Hessian form | |||
Gu Haihua,Gu Dawu | |||
Computer Science and Technology 19 November 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Pairings in elliptic curve cryptography are functions which map a pair of elliptic curve points to an element of the multiplicative group of a finite field. In recent years, many new and useful cryptographic protocols based on pairings have been proposed. The fast implementations of pairings have become a subject of active research areas in elliptic curve cryptography. In this paper, we propose the first algorithm for computing the Tate pairing on elliptic curves in Hessian form. Analysis indicates that it is faster than all algorithms of Tate pairing computation known so far for Weierstrass and Edwards curves excepted for the very special curves with a_4=0, a_6=b^2. | |||
TO cite this article:Gu Haihua,Gu Dawu. Efficient Pairing Computation on Elliptic Curves in Hessian form[OL].[19 November 2009] http://en.paper.edu.cn/en_releasepaper/content/36843 |
4. Fast Identity-Based Encryption Using Combined Public Keys | |||
Jiqiang Liu,Sheng Zhong | |||
Computer Science and Technology 20 March 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Identity-based encryption (IBE) is a very useful tool in cryptography. It has many potential applications. However, existing IBE schemes are signicantly slower than regular public key cryptosystems; thus, they may not be able to meet the need of some applications in practice. In this paper, we propose a simple IBE scheme, using a technique of combined public keys. Our IBE scheme is very fast, having time costs close to those of a regular public key cryptosystem, the ElGamal cryptosystem. We show that our IBE scheme is semantically secure under the Decisional Diffie-Hellman (DDH) Assumption. In addition, we give an identity-based signature scheme using the same technique. | |||
TO cite this article:Jiqiang Liu,Sheng Zhong. Fast Identity-Based Encryption Using Combined Public Keys[OL].[20 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30527 |
5. An Efficient Hardware-based PIR Scheme | |||
Lan Tian,Qin Zhiguang | |||
Computer Science and Technology 09 January 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:An hwPIR (hardware-based Private Information Retrieval) protocol allows a user to retrieve one of N records from a database without revealing the identity of the record to the database server using a server-side trusted hardware. In this paper, we present a new hwPIR protocol which achieves computation complexity while keeping the same communication overhead. Two N-length memory buffers are used to avoid the most time-consuming process, periodic reshuffle. Although this scheme is not fully secured, we believe it’s secure enough in practice and easy to implement. | |||
TO cite this article:Lan Tian,Qin Zhiguang. An Efficient Hardware-based PIR Scheme[OL].[ 9 January 2009] http://en.paper.edu.cn/en_releasepaper/content/27584 |
6. Binary-Price Proxy Auction Protocol | |||
Lan Tian,Qin Zhiguang | |||
Computer Science and Technology 07 January 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The paper presents a distributed 2nd-price proxy auction protocol that doesn’t require bidders to be constantly online after submitting their bid-chains in P2P network. That is, bidders can be offline other than submitting their bid-chains, and other peers in the P2P network conduct the auction process instead. During the whole protocol, bid-chains containing lower prices will be discarded remaining encrypted forms, and only the one containing highest price is left. Compared with other auction protocols, our protocol has properties of sealed-bid along with distributed bid auction, and it allows the bidders to submit their bids asynchronously meanwhile keeps all the losing bids unrevealed even after the auction is resolved. | |||
TO cite this article:Lan Tian,Qin Zhiguang. Binary-Price Proxy Auction Protocol[OL].[ 7 January 2009] http://en.paper.edu.cn/en_releasepaper/content/27412 |
7. Research on security of e-payment in e-commerce | |||
DENG Guo-Xu,WANG Zhi-Qian | |||
Computer Science and Technology 24 September 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Electronic payment is a critical technology to ensure the normal running of electronic commerce. E-payment can work on Internet, mobile phone and PSTN. They achieve security mainly through SSL and SET. However, the detailed implementations are different. This paper researches the secure schemes of them and seeks a proper way to ensure the security of e-payment on PSTN network on which there is not even an operative method. | |||
TO cite this article:DENG Guo-Xu,WANG Zhi-Qian. Research on security of e-payment in e-commerce [OL].[24 September 2008] http://en.paper.edu.cn/en_releasepaper/content/24319 |
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 |
9. Advanced Framework for Iterative Hash Functions---C-hash | |||
Zhimin Li,Bo Yang,Lin Li,Shihui Zheng,Yixian Yang,Zhang Zhihui | |||
Computer Science and Technology 14 November 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we study the cryptanalytical techniques to perform Joux multi-collision, Kelsey and Schneier generic long message second preimage attack and Kelsey and Kohno herding attack on the Merkle-Damgard construction as well as its variants with XOR-linear/additive checksums and propose an advanced Merkle-Damgard construction, C-hash, by changing the feedback addition value, which can add the computation complexity of the generic attacks, compared with Merkle-Damgard construction and its variants. | |||
TO cite this article:Zhimin Li,Bo Yang,Lin Li, et al. Advanced Framework for Iterative Hash Functions---C-hash[OL].[14 November 2007] http://en.paper.edu.cn/en_releasepaper/content/16347 |
10. Threats to IM and Security Mechanism Analysis of XMPP | |||
Zhenxing Cui,Zhihua Gu | |||
Computer Science and Technology 02 July 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Security has become a major disincentive to the development of instant Messaging. This paper focused on security issues related to instant messaging. It firstly introduced IM and XMPP, and then mainly discussed kinds of security threats to IM Systems and the security mechanism of XMPP, lastly, raised several security considerations in implementation of XMPP. | |||
TO cite this article:Zhenxing Cui,Zhihua Gu. Threats to IM and Security Mechanism Analysis of XMPP[OL].[ 2 July 2007] http://en.paper.edu.cn/en_releasepaper/content/13806 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated