How to reduce your enemy's information
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Experimental quantum cryptography
Journal of Cryptology - Eurocrypt '90
Secret-key reconciliation by public discussion
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Protocols for Secret Key Agreement by Public Discussion Based on Common Information
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On Reconciliation of Discrepant Sequences Shared through Quantum Mechanical Channels
ISW '97 Proceedings of the First International Workshop on Information Security
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Correcting errors without leaking partial information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Efficient reconciliation protocol for discrete-variable quantum key distribution
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Information reconciliation for quantum key distribution
Quantum Information & Computation
White-light interferometric method for secure key distribution
The Journal of Supercomputing
Quantum Information & Computation
High performance error correction for quantum key distribution using polar codes
Quantum Information & Computation
Hi-index | 0.00 |
Information-theoretic secret key agreement generally consists of three phases, namely, advantage distillation information reconciliation and privacy amplification. Advantage distillation is needed in the case when two legitimate users, Alice and Bob, start in a situation which is inferior to that of the adversary Eve. The aim for them is to gain advantage over Eve in terms of mutual information between each other. Information reconciliation enables Alice and Bob to arrive at a common string by error correction techniques. Finally they distill a highly secret string from the common string in the privacy amplification phase. For the scenario where Alice and Bob as well as Eve have access to the output of a binary symmetric source by means of (three) binary symmetric channels, there are several advantage distillation and information reconciliation protocols proposed. In this paper, we present a general protocol to implement both advantage distillation and information reconciliation. Simulation results are compared with known protocols. A connection between our protocol and the known protocols is given.