Plug and play encryption
- 561 Downloads
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.
KeywordsDiscrete Logarithm Secure Channel Subgroup Generator Honest Player Internal Copy
- [B91]D. Beaver. “Foundations of Secure Interactive Computing.” Advances in Cryptology — Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 377–391.Google Scholar
- [B95]D. Beaver. “Adaptive Zero Knowledge and Computational Equivocation.” Proceedings of the 28 th STOC, ACM, 1996, 629–638.Google Scholar
- [B96]D. Beaver. “Plausible Deniability.” Advances in Cryptology — Pragocrypt '96 Proceedings, CTU Publishing House, 1996, 272–288.Google Scholar
- [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
- [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
- [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
- [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
- [DP92]A. DeSantis, G. Persiano. “Zero-Knowledge Proofs of Knowledge Without Interaction.” Proceedings of the 33rd FOCS, IEEE, 1992, 427–436.Google Scholar
- [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
- [MR91]S. Micali, P. Rogaway. “Secure Computation.” Advances in Cryptology — Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 392–404.Google Scholar
- [SiSp94]M. Sipser, D. Spielman. “Expander Codes.” Proceedings of the 35 th FOCS, IEEE, 1994, 566–576.Google Scholar