A nonce-based protocol for multiple authentications
ACM SIGOPS Operating Systems Review
Experimental quantum cryptography
Journal of Cryptology - Eurocrypt '90
Provably secure session key distribution: the three party case
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Provably authenticated group Diffie-Hellman key exchange
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Cryptography and Network Security: Principles and Practice
Cryptography and Network Security: Principles and Practice
Freshness Assurance of Authentication Protocols
ESORICS '92 Proceedings of the Second European Symposium on Research in Computer Security
Efficient network authentication protocols: lower bounds and optimal implementations
Distributed Computing
Man-in-the-middle in tunnelled authentication protocols
Proceedings of the 11th international conference on Security Protocols
Proof of security of quantum key distribution with two-way classical communications
IEEE Transactions on Information Theory
Fault tolerant deterministic quantum communications using GHZ states over collective-noise channels
Quantum Information Processing
Quantum Information Processing
Trojan horse attack free fault-tolerant quantum key distribution protocols
Quantum Information Processing
Quantum Information Processing
Hi-index | 0.00 |
This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, ushering in new directions in classical cryptography and quantum cryptography. Two three-party QKDPs, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination, which include the following: 1) security against such attacks as man-in-the-middle, eavesdropping and replay, 2) efficiency is improved as the proposed protocols contain the fewest number of communication rounds among existing QKDPs, and 3) two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this work also presents a new primitive called the Unbiased-Chosen Basis (UCB) assumption.