Information-theoretically secure protocols and security under composition

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 109-118

  Kushilevitz, Eyal ^a   Lindell, Yehuda ^b   Rabin, Tal ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Information theoretic security; Protocol composition; Secure computation; Theory of cryptography

Indexed keywords

ADAPTIVE SYSTEMS; CRYPTOGRAPHY; INFORMATION ANALYSIS; NETWORK PROTOCOLS; SECURITY OF DATA; THEOREM PROVING;

INFORMATION-THEORETIC SECURITY; PROTOCOL COMPOSITION; SECURE COMPUTATION; THEORY OF CRYPTOGRAPHY;

COMPUTATION THEORY;

EID: 33748109704     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132532     Document Type: Conference Paper

References (22)

1. 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.
2. D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377-391, 1991.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations. In 201A STOC, pages 1-10, 1988.
4. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143-202, 2000.
5. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136-145, 2001.
6. D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In 20th STOC, pages 11-19, 1988.
7. 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.
8. 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.
9. D. Dolev, C. Dwork, and M. Naor. Non-malleable Cryptography. SICOMP, 30(2):391-437, 2000.
10. Y. Dodis and S. Micali. Parallel Reducibility for Information- Theoretically Secure Computation. In CRYPTO'00, (LNCS 1880), pages 74-92, 2000.
11. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-knowledge. JACM, 51(6):851-898, 2004.
12. Uri Feige. Alternative Models for Zero Knowledge Interactive Proofs. PhD thesis, 1990.
13. 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.
14. O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In 19th STOC, pages 218-229, 1987.
15. Oded Goldreich. Foundations of Cryptography: Volume 2. Cambridge University Press, 2004.
16. Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 35th STOC, pages 683-692, 2003.
17. Y. Lindell. General Composition and Universal Composability in Secure Multi-Party Computation. In 44st FOCS, pages 394-403, 2003.
18. Y. Lindell. Lower Bounds for Concurrent Self Composition. In 1st TCC, Springer-Verlag (LNCS 2951), pages 203-222, 2004.
19. S. Micali and P. Rogaway. Secure Computation. In CRYPTO'91, pages 392-404, 1991.
20. B. Pfitzmann and M. Waidner. Composition and Integrity Preservation of Secure Reactive Systems. In 7th ACM CCS, pages 245-254, 2000.
21. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In 21st STOC, pages 73-85, 1989.
22. A. C-C. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162-167, 1986.