Abstract
We describe a key agreement system based on the assumption that there exists a public broadcast channel transmitting data at such a rate that an eavesdropper cannot economically store all the data sent over a certain time period. The two legitimate parties select bits randomly from this channel, and use as key bits those which they have selected in common. The work is inspired by recent work of Maurer, [3].
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. on Information Theory IT-22 (1976) 644–654
Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. of Cryptology 5 (1992) 53–66
Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Trans. on Information Theory 39 (1993) 733–742
Wyner, A.D.: The wire-tap channel. Bell System Tech. J. 54 (1975) 1355–1387
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mitchell, C.J. (1995). A storage complexity based analogue of Maurer key establishment using public channels. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-60693-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60693-2
Online ISBN: 978-3-540-49280-1
eBook Packages: Springer Book Archive