Secret-Key Agreement without Public-Key Cryptography

Extended Abstract
  • Tom Leighton
  • Silvio Micali
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 773)

Abstract

In this paper, we describe novel approaches to secret-key agreement. Our schemes are not based on public-key cryptography nor number theory. They are extremely efficient implemented in software or make use of very simple unexpensive hardware. Our technology is particularly well-suited for use in cryptographic scenarios like those of the Clipper Chip, the recent encryption proposal put forward by the Clinton Administration.

Keywords

Protected Memory Honest User Secure Chip Time Statistical Test Conventional Cryptosystems 
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.
Download to read the full conference paper text

References

  1. 1.
    N. Alon, P. Erdos, and T. Spencer. The Probabilistic Method. Wiley Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, NY, 1992.Google Scholar
  2. 2.
    R. Blom. An Optimal Class of Symmetric Key Generation Systems. In Advances in Cryptology: Proceedings of Eurocrypt 84, Lecture Notes in Computer Science, vol,. 209, Springer-Verlag, Berlin, 1987, pp. 335–338.Google Scholar
  3. 3.
    C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly Secure Key Distribution for Dynamic Conferences. In Advances in Cryptology: Proceedings of CRYPTO’ 92, Lecture Notes in Computer Science, Springer Verlag, 1992.Google Scholar
  4. 4.
    W. Diffie and M.E. Hellman New Direction in Cryptography. In IEEE Transaction on Information Theory, vol. 22, no. 6, December 1976, pp. 644–654.CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    O. Goldreich, S. Goldwasser, and S. Micali How To Construct Random Functions. In J. of the ACM, vol. 33, no. 4, October 1986, pp. 792–807.CrossRefMathSciNetGoogle Scholar
  6. 6.
    S. Micali. Fair Public-Key Cryptosystems. In Advances in Cryptology: Proceedings of CRYPTO’ 92, Lecture Notes in Computer Science, Springer Verlag, 1992.Google Scholar
  7. 7.
    R. M. Needham and M.D. Schroeder. Using Encryption for Authentication in Large Networks of Computers. In Comm. ACM, vol. 21, no. 12, December 1978, pp. 993–999.CrossRefMATHGoogle Scholar
  8. 8.
    Y. Zheng. Personal Communication, September 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Tom Leighton
    • 1
    • 2
  • Silvio Micali
    • 2
  1. 1.Mathematics DepartmentMassachusetts Institute of TechnologyCambridge
  2. 2.Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridge

Personalised recommendations