Eyal Kushilevitz
Yehuda Lindell
ABSTRACT
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies security under concurrent composition. This question is motivated by the folklore that all known protocols that are secure in the information-theoretic setting are indeed secure under concurrent composition. We provide answers to this question for a number of different settings (i.e., considering perfect versus statistical security, and concurrent composition with adaptive versus fixed inputs). Our results enhance the understanding of what is necessary for obtaining security under composition, as well as providing tools (i.e., composition theorems) that can be used for proving the security of protocols under composition while considering only the standard stand-alone definitions of security.
- D. Beaver. Multiparty Protocols Tolerating Half Faulty Processors. Multiparty Protocols Tolerating Half Faulty Processors. In CRYPTO'89, Springer-Verlag (LNCS 435), pages 560--572, 1990.]] Google Scholar
Digital Library
- D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377--391, 1991.]] Google ScholarDigital Library
- M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations. In 20th STOC, pages 1--10, 1988.]] Google ScholarDigital Library
- R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143--202, 2000.]]Google Scholar
- R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136--145, 2001.]] Google ScholarDigital Library
- D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In 20th STOC, pages 11--19, 1988.]] Google ScholarDigital Library
- R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient Multiparty Computations with Dishonest Minority. In EUROCRYPT'99, Springer-Verlag (LNCS 1592), pages 311--326, 1999.]]Google Scholar
- R. Canetti and H. Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels. In EUROCRYPT'02, Springer-Verlag (LNCS 2332), pages 337--351, 2002.]] Google ScholarDigital Library
- D. Dolev, C. Dwork, and M. Naor. Non-malleable Cryptography. SICOMP, 30(2):391--437, 2000.]] Google ScholarDigital Library
- Y. Dodis and S. Micali. Parallel Reducibility for Information-Theoretically Secure Computation. In CRYPTO'00, (LNCS 1880), pages 74--92, 2000.]] Google ScholarDigital Library
- C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-knowledge. JACM, 51(6):851--898, 2004.]] Google ScholarDigital Library
- Uri Feige. Alternative Models for Zero Knowledge Interactive Proofs. PhD thesis, 1990.]]Google Scholar
- S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO'90, Springer-Verlag (LNCS 537), pages 77--93, 1990.]] Google ScholarDigital Library
- O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In 19th STOC, pages 218--229, 1987.]] Google ScholarDigital Library
- Oded Goldreich. Foundations of Cryptography: Volume 2. Cambridge University Press, 2004.]] Google ScholarDigital Library
- Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 35th STOC, pages 683--692, 2003.]] Google ScholarDigital Library
- Y. Lindell. General Composition and Universal Composability in Secure Multi-Party Computation. In 44st FOCS, pages 394--403, 2003.]] Google ScholarDigital Library
- Y. Lindell. Lower Bounds for Concurrent Self Composition. In 1st TCC, Springer-Verlag (LNCS 2951), pages 203--222, 2004.]]Google Scholar
- S. Micali and P. Rogaway. Secure Computation. In CRYPTO'91, pages 392--404, 1991.]] Google ScholarDigital Library
- B. Pfitzmann and M. Waidner. Composition and Integrity Preservation of Secure Reactive Systems. In 7th ACM CCS, pages 245--254, 2000.]] Google ScholarDigital Library
- T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In 21st STOC, pages 73--85, 1989.]] Google ScholarDigital Library
- A. C-C. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162--167, 1986.]]Google ScholarDigital Library
Index Terms
- Information-theoretically secure protocols and security under composition
Recommendations
Information-Theoretically Secure Protocols and Security under Composition
We investigate the question of whether the security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these protocols under concurrent composition. This question is motivated by ...
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest majority that use the underlying primitive (e.g., enhanced trapdoor ...
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently in a network. In this paper, we prove lower bounds and impossibility results for secure protocols in this setting. First and foremost, we prove that ...
Comments