A storage complexity based analogue of Maurer key establishment using public channels

  • C. J. Mitchell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1025)


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].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. on Information Theory IT-22 (1976) 644–654CrossRefGoogle Scholar
  2. 2.
    Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. of Cryptology 5 (1992) 53–66MathSciNetGoogle Scholar
  3. 3.
    Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Trans. on Information Theory 39 (1993) 733–742CrossRefGoogle Scholar
  4. 4.
    Wyner, A.D.: The wire-tap channel. Bell System Tech. J. 54 (1975) 1355–1387Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • C. J. Mitchell
    • 1
  1. 1.Royal Holloway, University of LondonEghamUK

Personalised recommendations