Security and composition of multiparty cryptographic protocols

Journal of Cryptology

Volumn 13, Issue 1, 2000, Pages 143-202

  Canetti, Ran ^a  

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

Author keywords

Composition of protocols; Multiparty cryptographic protocols; Secure function evaluation; Security of protocols

Indexed keywords

EID: 0000731055     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459910006     Document Type: Article

References (52)

1. [Bl] D. Beaver, Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority, Journal ofCiyptology, vol. 4 (1991), pp. 75-122
2. [B2] D. Beaver, Foundations of secure interactive computing, Proc. CRYPTO '91, LNCS 576, SpringerVerlag, Berlin, 1991, pp. 377-391.
3. [BG] D. Beaver and S. Goldwasser, Multiparty computation with faulty majority, Proc. 30th Symp. o Foundations of Computer Science (FOCS), IEEE, 1989, pp. 468-473
4. [BH] D. Beaver and S. Haber, Cryptographic protocols provably secure against dynamic adversaries, Advances in Cryptology -Eurociypt '92, LNCS 658, Springer-Verlag, Berlin,1992, pp. 307-323.
5. [BCK] M. Bellare, R. Canetti, and H. Krawczyk, A modular approach to the design and analysis of authentication and key-exchange protocols, Proc. 30th Symp. on Theory of Computing (STOC), ACM, 1998, pp. 419-428.
6. [BCG] M. Ben-Or, R. Canetti, and O. Goldreich, Asynchronous secure computations, Proc. 25lh Symp. o Theory of Computing (STOC), ACM, 1993, pp. 52-61
7. [BGW] M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic faulttolerant distributed computation, Proc. 20th Symp. on Theory of Computing (STOC), ACM, 1988, pp. 1-10.
8. [C] R. Canetti, Studies in Secure Multi-Party Computation and Applications, Ph.D. Thesis, Weizman Institute, Rehovot, Israel, 1995.
9. [CFGN] R. Canetti, U. Feige, O. Goldreich, and M. Naor, Adaptively secure computation, Proc. 28//1 Symp on Theory of Computing (STOC), ACM, 1996. Fuller version in MIT-LCS-TR #682,1996.
10. [CH] R. Canetti and A. Herzberg, Maintaining security in the presence of transient faults, Proc. CRYPT '94, LNCS 839, Springer-Verlag, Berlin, 1994, pp. 425-436.
11. [CG1] R. Canetti and R. Gennaro, Incoercible multiparty computation, Proc. 31th Symp. on Foundation of Computer Science (FOCS), IEEE, 1996, pp. 504-513.
12. [CGHN] R. Canetti, R. Gennaro, A. Herzberg, and D. Naor, Proactive security: long-term protection agains break-ins, CryptoBytes, vol. 3, no. 1 (1997), 1-8
13. [CG2] R. Canetti and S. Goldwasser, A threshold cryptosystem secure against adaptive chosen ciphertext attacks, Proc. Eurociypt 99, Springer-Verlag, Berlin, 1999, pp. 90-103. Fuller version available on-line at http://philby.ucsd.edu
14. [CHH] R. Canetti, S. Halevi, and A. Herzberg, How to maintain authenticated communication, this issue. Preliminary version in Proc. I6lh Symp. on Principles of Distributed Computing (PODC), ACM, 1997, pp. 15-25
15. [CKOR] R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosen, Randomness versus fault-tolerance, this issue. Preliminary version in Proc. \6th Symp. on Principles of Distributed Computing (PODC), ACM, 1997, pp. 35-45.
16. [CO] R. Canetti and R. Ostrovsky, Secure computation with honest-looking parties: what if nobody i truly honest?, Proc. 3laSymp. on Theory of Computing (STOC), ACM, 1999, pp. 255-264.
17. [CCD] D. Chaum, C. Crepeau, and I. Damgard, Multiparty unconditionally secure protocols, Proc. 20t Symp. on the Theory of Computing (STOQ, ACM, 1988, pp. 11-19
18. [CK] B. Chor and E. Kushilevitz, A zero-one law for boolean privacy, SIAM Journal on Discrete Mathematics, vol. 4 (1991), pp. 36-47.
19. Preliminary version in Proc. 2\st Symp. on Tlieory of Computing (STOQ, ACM, 1989, pp. 62-72
20. [COM] R. Cramer, I. Damgard, and U. Maurer, Span programs and general secure multiparty computation, Manuscript, 1998.
21. [DF] Y. Desmedt and Y. Frankel, Threshold cryptosystems, in G. Brassard, editor, Advances in Cryptolog - Crypto '89, LNCS No. 435, Springer-Verlag, Berlin, 1989, pp. 307-315.
22. [DOW] W. Diffie, P. van Oorschot and M. Wiener, Authentication and authenticated key exchanges, Designs Codes and Cryptography, vol. 2 (1992), pp. 107-125
23. [DDN] D. Dolev, C. Dwork, and M. Naor, Non-malleable cryptography, SIAM Journal on Computing, to appear. Preliminary version in Proc. 23rd Symposium on Tlieory of Computing (STOC), ACM, 1991.
24. [F] P. Feldman, A practical scheme for non-interactive verifiable secret sharing, Proc. 28//1 Symp. o Foundations of Computer Science (FOCS), IEEE, 1987, pp. 427-437.
25. [GHY] Z. Galil, S. Haber, and M. Yung, Cryptographic computation: secure faut-tolerant protocols and th public-key model, Proc. CRYPTO '87, LNCS 293, Springer-Verlag, Berlin, 1988, pp. 135-155.
26. [GJKR] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust threshold DSS signatures, Proc. Eurocrypt '96, LNCS 1070, Springer-Verlag, verlin, 1996, pp. 354-371
27. [Gl] O. Goldreich, A uniform complexity treatment of encryption and zero-knowledge. Journal of Cryptology, vol. 6, no. 1 (1993), pp. 21-53.
28. [G2] O. Goldreich, Foundations of Cryptography (Fragment's of a Book), Weizmann Institute of Science Rehovot, Israel, 1995. (Avaliable at http://philby.ucsd.edu.
29. [G3] O. Goldreich. Secure Multi-Party Computation, 1998. (Avaliable at http://philby.ucsd.edu.)
30. [GK] O. Goldreich and H. Krawczyk, On the composition of zero-knowledge proof systems, SIAM Journa on Computing, vol. 25, no. 1 (1996)
31. [GMW1] O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity or all language in NP have zero-knowledge proof systems, Journal of the ACM, vol. 38, no. 1 (1991), pp. 691-729
32. Preliminary version in Proc. 11th Symp. on Foundations of Computer Science (FOCS), IEEE, 1986 pp. 174-187
33. [GMW2] O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, Proc. 19th Symp. o Theory of Computing (STOC), ACM, 1987, pp. 218-229
34. [GO] O. Goldreich and Y. Oren, Definitions and properties of zero-knowledge proof systems, Journal of Cryptology, vol. 7, no. 1 (1994), pp. 1-32.
35. Preliminary version by Y. Oren in Proc. 28th Symp. on Foundations of Computer Science (FOCS), IEEE, 1987.
36. [GL] S. Goldwasser and L. Levin, Fair computation of general functions in presence of immoral majority Proc. CRYPTO '90, LNCS 537, Springer-Verlag, Berlin, 1990.
37. [GM] S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences vol. 28, no. 2 (1984), pp. 270-299.
38. [GMR] S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems SIAM Journal on Computing, vol. 18, no. 1 (1989), pp. 186-208
39. [HM] M. Hirt and U. Maurer, Complete characterization of adversaries tolerable in secure multiparty computation, this issue. Preliminary version in Proc. 16th Symp. on Principles of Distributed Computing (PODC), ACM, 1997, pp. 25-34
40. [KKMO] J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and completeness in private computations, SIAM Journal of Computing,
41. to appear. Preliminary versions in Proc. 23rd Symp. on Tlieory of Computing (STOC), ACM, 1991,
42. by Kilian and in Proc. 35th Symp. on Foundations of Computer Science (FOCS), IEEE, 1994, by Kushilevitz, Micali, and Ostrovsky.
43. [K] E. Kushilevitz, Privacy and communication complexity, SIAM Journal on Discrete Mathematics, vol. 5, no. 2 (1992), pp. 273-284.
44. Preliminary version in Proc. 29th Symp. on Foundations of Computer Science (FOCS), IEEE, 1989.
45. [MR] S. Micali and P. Rogaway, Secure computation, Unpublished manuscript, 1992. Preliminary versio in Proc. CRYPTO '91, LNCS 576, Springer-Verlag, Berlin, 1991, pp. 392-4104.
46. [M] S. Micali, Advanced class on cryptographic protocols, given at MIT, Spring 1996.
47. [OY] R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, Proc. 10th Symp. on Principle of Distributed Computing (PODC), ACM, 1991, pp. 51-59.
48. [R] T. Rabin, A simplified approach to threshold and proactive RSA, Proc. CRYPTO '98, LNCS Springer-Verlag, Berlin, 1998, pp. 89-102
49. [RB] T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proc. 2lst Symp. on Theory of Computing (STOC), ACM, 1989, pp. 73-85.
50. [Yl] A. Yao, Protocols for secure computation, Pwc. 13rd Symp. on Foundations of Computer Scienc (FOCS), IEEE, 1982, pp. 160-164.
51. [ Y2] A. Yao, Theory and applications of trapdoor functions, Proc. 23rd Symp. on Foundations of Compute Science (FOCS), IEEE, 1982, pp. 80-91.
52. [Y3] A. Yao, How to generate and exchange secrets, Proc. 21th Symp. on Foundations of Compute Science (FOCS), IEEE, 1986, pp. 162-167.