Adaptive versus non-adaptive security of multi-party protocols

Journal of Cryptology

Volumn 17, Issue 3, 2004, Pages 153-207

  Canetti, Ran ^a   Damgård, Ivan ^b   Dziembowski, Stefan ^c   Ishai, Yuval ^d   Malkin, Tal ^e  

^a IBM RESEARCH   (United States)

^b AARHUS UNIVERSITY   (Denmark)

^c UNIVERSITY OF WARSAW   (Poland)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^e Department of Earth and Environmental Sciences   (United States)

Author keywords

Adaptive security; Definitions of security; Multi party protocols

Indexed keywords

ADAPTIVE SECURITY; CRYPTOGRAPHIC PROTOCOLS; MULTI PARTY PROTOCOLS;

DATA PRIVACY; INFORMATION DISSEMINATION; NETWORK PROTOCOLS; SECURITY OF DATA; THEOREM PROVING;

CRYPTOGRAPHY;

EID: 4344713032     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-004-0135-x     Document Type: Article

References (38)

1. [B1] D. Beaver, Secure Multi-Party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority, J. Cryptology, vol. 4, pages 75-122, 1991.
2. [B2] D. Beaver, Plug and Play Encryption, Proc. CRYPTO '97, pages 75-89, 1997.
3. [B3] P. Billingsley, Probability and Measure, 2nd edition, Wiley, New York, 1986.
4. [BC] G. Brassard and C. Crepeau, Nontransitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond, Proc. 27th FOCS, pages 188-195, 1986.
5. [BGW] M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. 20th STOC, pages 1-10, 1988.
6. [BH] D. Beaver and S. Haber, Cryptographic Protocols Provably Secure Against Dynamic Adversaries, Proc. Eurocrypt '92, pages 307-323, 1992.
7. [C1] R. Canetti, Security and Composition of Multiparty Cryptographic Protocols, J. Cryptology, vol. 13, no. 1, pages 143-202, 2000. On-line version at http:/philby.ucsd.edu/cryptolib/1998/98-18.html.
8. [C2] R. Canetti, Universally Composable Security: A New Paradigm for Cryptographic Protocols, Proc. 42nd FOCS, pages 136-145,2001. Full version available at http/eprint.iacr.org/2000/067.
9. [CCD] D. Chaum, C. Crepeau, and I. Damgaard, Multi-Party Unconditionally Secure Protocols, Proc. 20th STOC, pages 11-19, 1988.
10. [CDG] D. Chaum, I. Damgaard, and J. van de Graaf, Multi-Party Computations Ensuring Privacy of Each Party's Input and Correctness of the Result, Proc. CRYPTO '87, pages 87-119, 1987.
11. [CDM] R. Cramer, I. Damgaard, and U. Maurer, General Secure Multi-Party Computation from Any Linear Secret-Sharing Scheme, Proc. EuroCrypt 2000, pages 316-334, 2000.
12. [CFGN] R. Canetti, U. Feige, O. Goldreich, and M. Naor, Adaptively Secure Computation, Proc. 28th STOC, pages 639-648, 1996. Fuller version in MIT-LCS-TR #682, 1996.
13. [CHP] D. Chaum, E. v. Heijst, and B. Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer, Proc. CRYPTO '91, pages 470-484, 1991.
14. [CK] B. Chor and E. Kushilevitz, A Zero-One Law for Boolean Privacy, SIAM J. Disc. Math., vol. 4, pages 36-47, 1991. Preliminary version in Proc. 21st STOC, pages 62-72, 1989.
15. [CK] B. Chor and E. Kushilevitz, A Zero-One Law for Boolean Privacy, SIAM J. Disc. Math., vol. 4, pages 36-47, 1991. Preliminary version in Proc. 21st STOC, pages 62-72, 1989.
16. [CS] R. Cramer and V. Shoup, A Practical Public-Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack, Proc. CRYPTO '98, pages 13-25, 1998.
17. [DDN] D. Dolev, C. Dwork, and M. Naor, Non-Malleable Cryptography, SIAM J. Computing, vol. 30, no. 2, pp. 391-437, 2000. Preliminary version in STOC'91.
18. [DN] D. Dolev, C. Dwork, and M. Naor, Non-Malleable Cryptography, SIAM J. Computing, vol. 30, no. 2, pp. 391-437, 2000. Preliminary version in STOC'91.
19. [DM] Y. Dodis and S. Micali, Parallel Reducibility for Information-Theoretically Secure Computation, Proc. CRYPTO 2000, pages 74-92, 2000.
20. [DN] I. Damgaard and J. Nielsen, Improved Non-Committing Encryption Schemes Based on a General Complexity Assumption, Proc. CRYPTO 2000, pages 432-450, 2000.
21. [G1] O. Goldreich, Secure Multi-Party Computation, 1998. Available at http:/philby.ucsd.edu.
22. [G2] O. Goldreich, Foundations of Cryptography, Cambridge University Press, Cambridge, 2001.
23. [GL] S. Goldwasser and L. Levin, Fair Computation of General Functions in Presence of Immoral Majority, Proc. CRYPTO '90, pages 77-93, 1990.
24. [GM] S. Goldwasser and S. Micali, Probabilistic encryption, J. Comput. Systems Sci., vol. 28, no. 2, pages 270-299, April 1984.
25. [GMW] O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, Proc. 19th STOC, pages 218-229, 1987.
26. [K] E. Kushilevitz, Privacy and Communication Complexity, SIAM J. Discrete Math., vol. 5, no. 2, pages 273-284, 1992. Preliminary version in Proc. 29th FOCS, 1989.
27. [K] E. Kushilevitz, Privacy and Communication Complexity, SIAM J. Discrete Math., vol. 5, no. 2, pages 273-284, 1992. Preliminary version in Proc. 29th FOCS, 1989.
28. [KKMO] J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and Completeness in Private Computations, SIAM J. Computing, vol. 29, pages 1189-1208, 2000. Preliminary versions by Kilian in Proc. 23rd STOC, 1991, and by Kushilevitz, Micali, and Ostrovsky in Proc. 35th FOCS, 1994.
29. [KKMO] J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and Completeness in Private Computations, SIAM J. Computing, vol. 29, pages 1189-1208, 2000. Preliminary versions by Kilian in Proc. 23rd STOC, 1991, and by Kushilevitz, Micali, and Ostrovsky in Proc. 35th FOCS, 1994.
30. [KKMO] J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and Completeness in Private Computations, SIAM J. Computing, vol. 29, pages 1189-1208, 2000. Preliminary versions by Kilian in Proc. 23rd STOC, 1991, and by Kushilevitz, Micali, and Ostrovsky in Proc. 35th FOCS, 1994.
31. [MR] S. Micali and P. Rogaway, Secure Computation, unpublished manuscript, 1992. Preliminary version in Proc. CRYPTO '91, pages 392-404, 1991.
32. [MR] S. Micali and P. Rogaway, Secure Computation, unpublished manuscript, 1992. Preliminary version in Proc. CRYPTO '91, pages 392-404, 1991.
33. [P] T. P. Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Proc. CRYPTO '91, pages 129-140, 1991.
34. [PSW] B. Pfitzmann, M. Schunter, and M. Waidner, Secure Reactive Systems, IBM Technical Report RZ 3206 (93252), May 2000.
35. [PW] B. Pfitzmann and M. Waidner, A General Framework for Formal Notions of Secure Systems, Hildesheimer Informatik-Berichte, ISSN 0941-3014, April 1994.
36. [S] A. Sahai, Non-Malleable, Non-Interactive Zero Knowledge and Adaptive Chosen Ciphertext Security, Proc. 40th FOCS, pages 543-553, 1999.
37. [Y1] A. Yao, Protocols for Secure Computation, Proc. 23rd FOCS, pages 160-164, 1982.
38. [Y2] A. Yao, How to generate and exchange secrets, Proc. 21th FOCS, pages 162-167, 1986.