Advertisement

Plug and play encryption

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1294)

Abstract

We present a novel protocol for secret key exchange that is provably secure against attacks by an adversary that is free to attack zero, one, or both parties in an adaptive fashion, at any time. This high degree of robustness enables larger, multiparty interactions (including multiparty secure computations) to substitute our protocol for secure private channels in a simple, plug-and-play fashion, without simultaneously limiting security analysis to attacks by static adversaries, i.e. adversaries whose corruption choices are fixed in advance.

No reliance on the assistance of third parties or on erasing partial computations is required. In addition to providing order-of-magnitude speedups over alternative approaches, the simplicity of our protocols lends itself to simple demonstrations of security. We present constructions that are based on a novel and counterintuitive use of the Diffie-Hellman key exchange protocol; our methods extend to other standard cryptographic assumptions as well.

Keywords

Discrete Logarithm Secure Channel Subgroup Generator Honest Player Internal Copy 
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

  1. [B91]
    D. Beaver. “Foundations of Secure Interactive Computing.” Advances in Cryptology — Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 377–391.Google Scholar
  2. [B95]
    D. Beaver. “Adaptive Zero Knowledge and Computational Equivocation.” Proceedings of the 28 th STOC, ACM, 1996, 629–638.Google Scholar
  3. [B96]
    D. Beaver. “Plausible Deniability.” Advances in Cryptology — Pragocrypt '96 Proceedings, CTU Publishing House, 1996, 272–288.Google Scholar
  4. [BH92]
    D. Beaver, S. Haber. “Cryptographic Protocols Provably Secure Against Dynamic Adversaries.” Advances in Cryptology — Eurocrypt '92 Proceedings, Springer-Verlag LNCS 658, 1993, 307–323.Google Scholar
  5. [BGW88]
    M. Ben-Or, S. Goldwasser, A. Wigderson. “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.” Proceedings of the 20 th STOC, ACM, 1988, 1–10.Google Scholar
  6. [CFGN96]
    R. Canetti, U. Feige, O. Goldreich, M. Naor. “Adaptively Secure Multiparty Computation.” Proceedings of the 28 th STOC, ACM, 1996, 639–648.Google Scholar
  7. [CCD88]
    D. Chaum, C. Crépeau, I. Damgård. “Multiparty Unconditionally Secure Protocols.” Proceedings of the 20 th STOC, ACM, 1988, 11–19.Google Scholar
  8. [DP92]
    A. DeSantis, G. Persiano. “Zero-Knowledge Proofs of Knowledge Without Interaction.” Proceedings of the 33rd FOCS, IEEE, 1992, 427–436.Google Scholar
  9. [DH76]
    W. Diffie, M. Hellman. “New Directions in Cryptography.” IEEE Transactions on Information Theory IT-22, November 1976, 644–654.CrossRefMathSciNetGoogle Scholar
  10. [GM84]
    S. Goldwasser, S. Micali. “Probabilistic Encryption.” J. Comput. Systems Set. 28, 1984, 270–299.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [GMR89]
    S. Goldwasser, S. Micali, C. Rackoff. “The Knowledge Complexity of Interactive Proof Systems.” SIAM J. on Computing 18:1, 1989, 186–208.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [GMW86]
    O. Goldreich, S. Micali, A. Wigderson. “Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design.” Proceedings of the 27 th FOCS, IEEE, 1986, 174–187.Google Scholar
  13. [MR91]
    S. Micali, P. Rogaway. “Secure Computation.” Advances in Cryptology — Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 392–404.Google Scholar
  14. [RSA78]
    R. Rivest, A. Shamir, L. Adleman. “A Method for Obtaining Digital Signatures and Public Key Cryptosystems.” Communications of the ACM 21:2, 1978, 120–126.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [SiSp94]
    M. Sipser, D. Spielman. “Expander Codes.” Proceedings of the 35 th FOCS, IEEE, 1994, 566–576.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  1. 1.Transarc Corp.Pittsburgh

Personalised recommendations