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 25 papers published in subject: > since this site started. |
Results per page: | 25 Total, 3 Pages | << First < Previous 1 2 3 |
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. 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 |
2. 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 |
3. 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 |
4. 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 |
5. A Novel Mechanism in MPLS Network under Adversarial Uncertainty | |||
Ying Zheng,Hu Hanping | |||
Computer Science and Technology 04 April 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:the advantage of multi-protocol label switching (MPLS) is its capability to route the packets through explicit paths. But the nodes in the paths may be possibly attacked by the adversarial uncertainty . Aiming at this problem in MPLS Network, in this paper, we propose a novel mechanism in MPLS network under adversarial uncertainty, making use of the theory of artificial intelligence, at first, we find the initialized label switching paths(LSPs) using the A* arithmetic, and secondly, during the process of data transmission, we switch the transmission path duly by taking advantage of the non-monotone reasoning mechanism. Compared to the traditional route mechanism ,the experimental results show that it improves the security if data transmission remarkably under our novel mechanism in MPLS network. | |||
TO cite this article:Ying Zheng,Hu Hanping. A Novel Mechanism in MPLS Network under Adversarial Uncertainty[OL].[ 4 April 2007] http://en.paper.edu.cn/en_releasepaper/content/11928 |
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: | 25 Total, 3 Pages | << First < Previous 1 2 3 |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated