The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
Secret-key reconciliation by public discussion
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
LFSR-based Hashing and Authentication
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Non-malleable extractors and symmetric key cryptography from weak secrets
Proceedings of the forty-first annual ACM symposium on Theory of computing
Privacy amplification with asymptotically optimal entropy loss
Proceedings of the forty-second ACM symposium on Theory of computing
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
CLIP: A Distributed Emulation Platform for Research on Information Reconciliation
NBIS '12 Proceedings of the 2012 15th International Conference on Network-Based Information Systems
Qphone: a quantum security VoIP phone
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Hi-index | 0.00 |
QKD (Quantum Key Distribution) technology, based on the laws of physics, can create an unconditionally secure key between communication parties. In recent years, researchers draw more and more attention to the QKD technology. Privac amplification is a very significant procedure in QKD system. In this paper, we propose the real-time privacy amplification (RTPA) scheme which converts the weak secret string W to a uniform key that is fully secret from Eve. We implement RTPA scheme based on CLIP (Cvqkd Ldpc experImental Platform) which is connected to the real quantum communication systems. Experimental results show that, our proposed RTPA scheme is very efficient when the bit error rate of quantum channel is lower than 0.06.