Secure and Efficient Two-Party Authenticated Key Agreement Protocol from Certificateless Public Key Encryption Scheme

Author(s):  
Mengbo Hou ◽  
Qiuliang Xu
Author(s):  
Kache Vishwamithra ◽  
G Santhosh Abhinai ◽  
S Aakash ◽  
M Rajvel

In passed-on overseeing, assets are everything considered in the cloud master's connection and dependably got the idea by the cloud clients through open channels. The key system decorations with a got channel foundation over a public channel for the ensured trades between a cloud client and a cloud ace association. The stream key design shows for passed on figuring experience the risky effects of express inconveniences, e.g., seeing low connection delay, disposing of verbalization the central issues, restoring client accreditation, and putting forth an attempt not to stun haphazardness. To manage these heaps, we propose a less testament 0-RTT dull AKA show against baffling eccentricity for secure station foundation in passed-on figuring. As a 0-RTT show, it as a rule speeds up the sensibility of the got channel foundation measure. Further, our show needn't unwind up around with the highlights of an infuriating circumstance a public key with a substance's character and beginning now and for an earnest period of time handles the check of the beginning issue. At long last, a solid security assessment of the show is other than proposed. The show doesn't just fulfill the standard security credits (e.g., known-key security, dull key-share), yet in like manner, solid security ensures, i.e., client certification and puzzling anomaly get.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Rui Guo ◽  
Qiaoyan Wen ◽  
Huixian Shi ◽  
Zhengping Jin ◽  
Hua Zhang

Certificateless cryptography aims at combining the advantages of public key cryptography and identity based cryptography to avoid the certificate management and the key escrow problem. In this paper, we present a novel certificateless public key encryption scheme on the elliptic curve over the ring, whose security is based on the hardness assumption of Bilinear Diffie-Hellman problem and factoring the large number as in an RSA protocol. Moreover, since our scheme requires only one pairing operation in decryption, it is significantly more efficient than other related schemes. In addition, based on our encryption system, we also propose a protocol to protect the confidentiality and integrity of information in the scenario of Internet of Things with constrained resource nodes.


Sign in / Sign up

Export Citation Format

Share Document