Abstract
We propose a private-key cryptosystem and a protocol for key agreement by public discussion that are unconditionally secure based on the sole assumption that an adversary's memory capacity is limited. No assumption about her computing power is made. The scenario assumes that a random bit string of length slightly larger than the adversary's memory capacity can be received by all parties. The random bit string can for instance be broadcast by a satellite or over an optical network, or transmitted over an insecure channel between the communicating parties. The proposed schemes require very high bandwidth but can nevertheless be practical.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Alon, O. Goldreich, J. Håstad, and R. Peralta, “Simple constructions of almost k-wise independent random variables,” Random Structures and Algorithms, vol. 3, no. 3, pp. 289–304, 1992. Preliminary version presented at 31st FOCS (1990).
C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer, “Generalized privacy amplification,” IEEE Transactions on Information Theory, vol. 41, pp. 1915–1923, Nov. 1995.
G. Brassard and C. Crépeau, “25 years of quantum cryptography,” SIGACT News, vol. 27, no. 3, pp. 13–24, 1996.
G. Brassard and L. Salvail, “Secret-key reconciliation by public discussion,” in Advances in Cryptology — EUROCRYPT '93 (T. Helleseth, ed.), vol. 765 of Lecture Notes in Computer Science, pp. 410–423, Springer-Verlag, 1994.
C. Cachin, Entropy Measures and Unconditional Security in Cryptography. Ph.D. dissertation No. 12187, ETH Zürich, 1997.
C. Cachin, “Smooth entropy and Rényi entropy,” in Advances in Cryptology — EUROCRYPT '97 (W. Fumy, ed.), vol. 1233 of Lecture Notes in Computer Science, pp. 193–208, Springer-Verlag, 1997.
C. Cachin and U. Maurer, “Linking information reconciliation and privacy amplification,” Journal of Cryptology, vol. 10, no. 2, pp. 97–110, 1997.
J. L. Carter and M. N. Wegman, “Universal classes of hash functions,” Journal of Computer and System Sciences, vol. 18, pp. 143–154, 1979.
T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.
C. Crépeau, “Efficient cryptographic protocols based on noisy channels,” in Advances in Cryptology — EUROCRYPT '97 (W. Fumy, ed.), vol. 1233 of Lecture Notes in Computer Science, pp. 306–317, Springer-Verlag, 1997.
C. Crépeau and J. Kilian, “Achieving oblivious transfer using weakened security assumptions,” in Proc. 29th IEEE Symposium on Foundations of Computer Science (FOCS), 1989.
R. Cruz, G. Hill, A. Kellner, R. Ramaswami, G. Sasaki, and Y. Yamabashi, Eds., “Special issue on optical networks,” IEEE Journal on Selected Areas in Communications, vol. 14, pp. 761–1052, June 1996.
Proc. 14th IEEE Symposium on Mass Storage Systems, IEEE Computer Society Press, 1995.
M. Luby, Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
M. Luby and A. Wigderson, “Pairwise independence and derandomization,” Tech. Rep. 95-035, International Computer Science Institute (ICSI), Berkeley, 1995.
J. L. Massey, “Contemporary cryptography: An introduction,” in Contemporary Cryptology: The Science of Information Integrity (G. J. Simmons, ed.), ch. 1, pp. 1–39, IEEE Press, 1991.
J. L. Massey and I. Ingemarsson, “The Rip van Winkle cipher: A simple and provably computationally secure cipher with a finite key,” in Proc. 1985 IEEE International Symposium on Information Theory, p. 146, 1985.
U. M. Maurer, “Conditionally-perfect secrecy and a provably-secure randomized cipher,” Journal of Cryptology, vol. 5, pp. 53–66, 1992.
U. M. Maurer, “Secret key agreement by public discussion from common information,” IEEE Transactions on Information Theory, vol. 39, pp. 733–742, 1993.
C. J. Mitchell, “A storage complexity based analogue of Maurer key establishment using public channels,” in Cryptography and Coding: 5th IMA Conference, Cirencester, UK (C. Boyd, ed.), vol. 1025 of Lecture Notes in Computer Science, pp. 84–93, Springer, 1995.
N. Nisan, “Extracting randomness: How and why — a survey,” in Proc. 11th Annual IEEE Conference on Computational Complexity, 1996.
M. Rabin. Personal Communication, 1997.
A. Rényi, “On measures of entropy and information,” in Proc. 4th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, (Berkeley), pp. 547–561, Univ. of Calif. Press, 1961.
R. L. Rivest, “Cryptography,” in Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), ch. 13, pp. 717–755, Elsevier, 1990.
L. P. Seidman, “Satellites for wideband access,” IEEE Communications Magazine, pp. 108–111, Oct. 1996.
C. E. Shannon, “Communication theory of secrecy systems,” Bell System Technical Journal, vol. 28, pp. 656–715, Oct. 1949.
P. W. Shor, “Algorithms for quantum computation: Discrete log and factoring,” in Proc. 35th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 124–134, 1994.
M. N. Wegman and J. L. Carter, “New hash functions and their use in authentication and set equality,” Journal of Computer and System Sciences, vol. 22, pp. 265–279, 1981.
D. Zuckerman, “Simulating BPP using a general weak random source,” Algorithmica, vol. 16, pp. 367–391, 1996. Preliminary version presented at 32nd FOCS (1991).
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Cachin, C., Maurer, U. (1997). Unconditional security against memory-bounded adversaries. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052243
Download citation
DOI: https://doi.org/10.1007/BFb0052243
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive