Optimization of key distribution protocols based on extractors for noisy channels within active adversaries

Authors:
Victor Yakovlev;Valery Korzhik;Mihail Bakaev;Guillermo Morales-Luna
Affiliations:
Department of Information Security of Telecommunication Systems, State University of Telecommunication, St. Petersburg, Russia;Department of Information Security of Telecommunication Systems, State University of Telecommunication, St. Petersburg, Russia;Department of Information Security of Telecommunication Systems, State University of Telecommunication, St. Petersburg, Russia;Computer Science, Cinvestav-IPN, Mexico City, Mexico
Venue:
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
Year:
2012

Citing 15
Cited 0

Construction of extractors using pseudo-random generators (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors

Journal of Computer and System Sciences - STOC 1999
Key Distribution Protocol Based on Noisy Channel and Error Detecting Codes

MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
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
Privacy Amplification Secure Against Active Adversaries

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Privacy Amplification Theorem for Noisy Main Channel

ISC '01 Proceedings of the 4th International Conference on Information Security
Key Agreement from Close Secrets over Unsecured Channels

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
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
Robust fuzzy extractors and authenticated key agreement from close secrets

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Generalized privacy amplification

IEEE Transactions on Information Theory - Part 2
An extension of the Shannon theory approach to cryptography

IEEE Transactions on Information Theory
Secret-key agreement over unauthenticated public channels .II. Privacy amplification

IEEE Transactions on Information Theory
Key Distribution Protocols Based on Noisy Channels in Presence of an Active Adversary: Conventional and New Versions With Parameter Optimization

IEEE Transactions on Information Theory
Secret key agreement by public discussion from common information

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the information-theoretic secure key distribution problem (KDP) over noisy binary symmetric channels with public discussion and in the presence of an active adversary. There are several versions of such protocols proposed by Maurer, Wolf, Renner, Dodis, Reyzin et al. We describe two new versions of KDP for the same channel model and with the use of extractors as a mean of privacy amplification but with the goal to maximize the key rate under an optimization of the protocol parameters. There are two novelties in solution of KDP: we get the extractor's seed directly from the distributed initial strings and we prove the main results in terms of explicit estimates without the use of the uncertain symbols O, Ω, Θ. Both asymptotic and non-asymptotic cases are presented. It is shown that the extractors can be superior to conventional hashing for very large lengths of initially distributed strings.