oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Three Party Quantum Authenticated Key Distribution Protocol Using Superposition States  [PDF]
K. Sathi Reddy,Raja Kumar Medapati
International Journal of Computer Technology and Applications , 2011,
Abstract: This paper presents a Quantum authenticated key distribution protocol that can perform key distribution and also ensure that the participants of the communication are authentic, both implicitly and explicitly. This protocol provides new directions in Classical cryptography and Quantum cryptography.The Participants of the protocol trust the third party regarding the authentication part only. Thus the proposed protocol will be preferable for network systems which deal with highly sensitive information, such as military, hospitals, research facilities. Our protocol utilizes polarized photons in superposition states for authentication and key distribution which provides high security against many attacks.
An Efficient Bilinear Pairing-Free Certificateless Two-Party Authenticated Key Agreement Protocol in the eCK Model  [PDF]
Yong-Jin Kim,Yong-Min Kim,Yong-Jin Choe,Hyong-Chol O
Computer Science , 2013,
Abstract: Recent study on certificateless authenticated key agreement focuses on bilinear pairing-free certificateless authenticated key agreement protocol. Yet it has got limitations in the aspect of computational amount. So it is important to reduce the number of the scalar multiplication over elliptic curve group in bilinear pairing-free protocols. This paper proposed a new bilinear pairing-free certificateless two-party authenticated key agreement protocol, providing more efficiency among related work and proof under the random oracle model.
Two-Round Password-Only Authenticated Key Exchange in the Three-Party Setting  [PDF]
Junghyun Nam,Kim-Kwang Raymond Choo,Sangchul Han,Juryon Paik,Dongho Won
Symmetry , 2015, DOI: 10.3390/sym7010105
Abstract: We present the first provably-secure three-party password-only authenticated key exchange (PAKE) protocol that can run in only two communication rounds. Our protocol is generic in the sense that it can be constructed from any two-party PAKE protocol. The protocol is proven secure in a variant of the widely-accepted model of Bellare, Pointcheval and Rogaway (2000) without any idealized assumptions on the cryptographic primitives used. We also investigate the security of the two-round, three-party PAKE protocol of Wang, Hu and Li (2010) and demonstrate that this protocol cannot achieve implicit key authentication in the presence of an active adversary.
A Three-Party Password Authenticated Key Exchange Protocol with Key Confirmation  [cached]
Gang Yao
International Journal of Wireless and Microwave Technologies , 2011, DOI: 10.5815/ijwmt.2011.05.03
Abstract: Three-party authenticated key exchange protocol is an important cryptographic technique in the secure communication areas, by which any two clients can verify the ability to use a server to establish communication. Recently, researchers have begun proposing new key exchange protocols that would not require the use of server public keys, but a human-memorable password. In this paper, we propose a new three-party password authenticated key exchange protocol with key confirmation. The security of our proposed protocol relies on the hardness of the bilinear Diffie-Hellman problem and Diffie-Hellman problem in the random oracle model, and the proposed protocol achieves the security attributes: dictionary attack resilience, known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.
Cryptanalysis and improvement of two certificateless three-party authenticated key agreement protocols  [PDF]
Haiyan Sun,Qiaoyan Wen,Hua Zhang,Zhengping Jin,Wenmin Li
Computer Science , 2013,
Abstract: Recently, two certificateless three-party authenticated key agreement protocols were proposed, and both protocols were claimed they can meet the desirable security properties including forward security, key compromise impersonation resistance and so on. Through cryptanalysis, we show that one neither meets forward security and key compromise impersonation resistance nor resists an attack by an adversary who knows all users' secret values, and the other cannot resist key compromise impersonation attack. Finally, we propose improved protocols to make up two original protocols' security weaknesses, respectively. Further security analysis shows that our improved protocols can remove such security weaknesses.
Anonymous Three-Party Password-Authenticated Key Exchange Scheme for Telecare Medical Information Systems  [PDF]
Qi Xie, Bin Hu, Na Dong, Duncan S. Wong
PLOS ONE , 2014, DOI: 10.1371/journal.pone.0102747
Abstract: Telecare Medical Information Systems (TMIS) provide an effective way to enhance the medical process between doctors, nurses and patients. For enhancing the security and privacy of TMIS, it is important while challenging to enhance the TMIS so that a patient and a doctor can perform mutual authentication and session key establishment using a third-party medical server while the privacy of the patient can be ensured. In this paper, we propose an anonymous three-party password-authenticated key exchange (3PAKE) protocol for TMIS. The protocol is based on the efficient elliptic curve cryptosystem. For security, we apply the pi calculus based formal verification tool ProVerif to show that our 3PAKE protocol for TMIS can provide anonymity for patient and doctor while at the same time achieves mutual authentication and session key security. The proposed scheme is secure and efficient, and can be used in TMIS.
Analysis And Improvement of Pairing-Free Certificate-Less Two-Party Authenticated Key Agreement Protocol For Grid Computing  [PDF]
Amr Farouk,Mohamed M. Fouad,Ahmed A. Abdelhafez
Computer Science , 2014, DOI: 10.5121/ijsptm.2014.3103
Abstract: The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless, certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the demands of grid computing. Security and efficiency are the main objectives of grid authentication protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key management approach for grid users. We also show, a GPC-AKA security protocol proof using formal automated security analysis Sycther tool.
Certificateless-based two-party authenticated key agreement protocol for multiple PKG environment
基于无证书的两方跨域认证密钥协商协议

LIU Xiao-qiong,PAN Jin,LI Guo-peng,
刘小琼
,潘进,李国朋

计算机应用研究 , 2012,
Abstract: This paper proposed a certificateless-based two-party authenticated key agreement protocol for a multiple PKG environment based on bilinear pairings in elliptic curves and elliptic curve discrete logarithm,which solved the key escrow issues inherited in the identity-based schemes effectively and preventing active attack by identity authentication.After confirming the correctness,the formal analysis based on applied Pi calculus shows fulfilled authentication and security.Compared with other two-party authenticated key agreement protocols for a multiple PKG environment, the newly proposed key agreement protocol has better security and efficiency.
Certificateless-based two-party authenticated key agreement protocol
无双线性对的无证书两方认证密钥协商协议

PAN Jin,LIU Xiao-qiong,LI Guo-peng,
潘 进
,刘小琼,李国朋

计算机应用研究 , 2012,
Abstract: Because of the high computational cost, bilinear pairing isn't equal to mobile communication environment. This paper proposed new certificateless-based two-party authenticated key agreement protocol without bilinear pairing. The agreement protocol solved the key escrow issues inherited in the identity-based schemes effectively and achieved identity authentication. And the computational cost decreased effectively without bilinear pairing. After confirming the correctness, the formal analysis based on Applied Pi calculus and ProVerif has shown fulfilled authentication and secure. Compared with other two-party authenticated key agreement protocols, the new proposed key agreement protocol has better security and efficiency.
An ECC-Based Two-Party Authenticated Key Agreement Protocol for Mobile Ad Hoc Networks  [cached]
Kavitha Ammayappan,Atul Negi,V. N. Sastry,Ashok Kumar Das
Journal of Computers , 2011, DOI: 10.4304/jcp.6.11.2408-2416
Abstract: Mobile ad hoc networks (MANETs) are known to be unprotected due to the nature of message propagation and the openness of public channel. Another important characteristic of MANETs is their being basically energy constrained. While it is known that symmetric key cryptography provides a high degree of secrecy and efficiency, but has a number of significant difficulties for the MANET domain in key distribution, key management, scalability and provision of non-repudiation. Public key cryptography (PKC) on other hand provides solutions to the problems inherent in symmetric key cryptography with authenticated key agreement protocols. However the constraints of MANETs such as mobility of nodes, lack of network services and servers make such a proposition difficult. In this paper, we propose a PKC based new energy efficient twoparty mutual authenticated key agreement protocol suitable for MANETs. Its security is based on the elliptic curve discrete logarithm assumption.We provide proof here for the security of the proposed protocol and show its relative better performance when compared with other relevant protocols.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.