Unconditionally Secure Key Agreement Protocol

Authors:
Cyril Prissette
Affiliations:
-
Venue:
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Year:
2001

Citing 5
Cited 0

Experimental quantum cryptography

Journal of Cryptology - Eurocrypt '90
In-Place Calculation of Minimum-Redundancy Codes

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Information-Theoretic Cryptography

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Information-theoretically secure secret-key agreement by NOT authenticated public discussion

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility under the assumption that Alice and Bob own specific devices such as quantum channel [2]. In this article, we propose a new key agreement protocol called CHIMERA which requires no specific device. This protocol is based on a generalization we propose of the reconciliation algorithm. This protocol is proved unconditionally secure.