Composition of secure multi-party protocols: A comprehensive study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2815, Issue , 2003, Pages 1-189

  Lindell, Yehuda ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048880578     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (90)

1. B. Barak. How to go Beyond the Black-Box Simulation Barrier. In 42nd FOCS, pages 106-115, 2001.
2. B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In 43rd FOCS, pages 345-355, 2002.
3. D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377-391, 1991.
4. D. Beaver. Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority. Journal of Cryptology, 4(2) :75-122, 1991.
5. D. Beaver. Plug and play encryption. In CRYPTO'97, Springer-Verlag (LNCS 1294), pages 75-89, 1997.
6. M. Bellare, A. Boldyreva, and S. Micali. Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. In EUROCRYPT'00, Springer-Verlag (LNCS 1807), pages 259-274, 2000.
7. D. Beaver and S. Goldwasser. Multiparty Computation with Fault Majority. In CRYPTO'89, Springer-Verlag (LNCS 435), 1989.
8. D. Beaver, S. Micali and P. Rogaway. The Round Complexity of Secure Protocols. In 22nd STOC, pages 503-513, 1990.
9. M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In 20th STOC, pages 1-10, 1988.
10. M. Blum How to Prove a Theorem So No One Else Can Claim It. Proceedings of the International Congress of Mathematicians, pages 1444-1451, 1986.
11. M. Blum, P. Feldman and S. Micali. Non-interactive zero-knowledge and its applications. In 20th STOC, pages 103-112, 1988.
12. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
13. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136-145. 2001. Full version available at http://eprint.iacr.org/2000/067.
14. R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-Party Computation. In 28th STOC, pages 639-648, 1996.
15. R. Canetti and M. Fischlin. Universally Composable Commitments. In CRYPTO'01, Springer-Verlag (LNCS 2139), pages 19-40, 2001.
16. R. Canetti and A. Herzberg. Maintaining Security in the Presence of Transient Faults. In CRYPTO'94, Springer-Verlag (LNCS 839), pages 425-438, 1994.
17. R. Canetti, J. Kilian, E. Petrank, and A. Rosen. Black-Box Concurrent Zero-Knowledge Requires Ω̃ (log n) Rounds. In 33rd STOC, pages 570-579, 2001.
18. 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.
19. R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universal Composition Without Set-Up Assumptions. In EUROCRYPTOS, Springer-Verlag (LNCS 2656), pages 68-86, 2003.
20. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494-503, 2002.
21. R. Canetti and T. Rabin. Universal Composition with Joint State. In CRYPTO'03, 2003.
22. D. Chaum, C. Crepeau and I. Damgard. Multi-party Unconditionally Secure Protocols. In 20th STOC, pages 11-19, 1988.
23. R. Cleve. Limits on the Security of Coin Flips when Half the Processors are Faulty. In 18th STOC, pages 364-369, 1986.
24. I. Damgard and J. Groth. Non-Interactive and Reusable Non-Malleable Commitment Schemes. In 35th STOC, pages 426-435, 2003.
25. I. Damgard and J.B. Nielsen. Improved non-committing encryption schemes based on general complexity assumptions. In CRYPTO'00, Springer-Verlag (LNCS 1880), pages 432-450, 2000.
26. I. Damgard and J.B. Nielsen. Perfect Hiding or Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. In CRYPTO'02, Springer-Verlag (LNCS 2442), pages 581-596, 2002.
27. A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, A. Sahai. Robust Non-interactive Zero-Knowledge. In CRYPTO'01, Springer-Verlag (LNCS 2139), pages 566-598, 2001.
28. A. De Santis and G. Persiano. Zero-Knowledge Proofs of Knowledge Without Interaction. In 33rd FOCS, pages 427-436, 1992.
29. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-Interactive and Non-Malleable Commitment. In 30th STOC, pages 141-150, 1998.
30. G. Di Crescenzo, J. Katz, R. Ostrovsky and A. Smith. Efficient and Non-interactive Non-malleable Commitment. In EUROCRYPT'01, Springer-Verlag (LNCS 2045), pages 40-59, 2001.
31. Y. Dodis and S. Micali. Parallel Reducibility for Information-Theoretically Secure Computation. In CRYPTO'00, Springer-Verlag (LNCS 1880), pages 74-92, 2000.
32. D. Dolev. The Byzantine Generals Strike Again. Journal of Algorithms, 3(1):14-30, 1982.
33. D. Dolev, C. Dwork and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
34. (Preliminary version in 23rd STOC, 1991.)
35. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
36. D. Dolev and H.R. Strong. Authenticated Algorithms for Byzantine Agreement. SIAM Journal on Computing, 12(4):656-665, 1983.
37. S. Even, O. Goldreich and A. Lempel. A Randomized Protocol for Signing Contracts. In Communications of the ACM, 28(6):637-647, 1985.
38. U. Feige. Alternative Models for Zero Knowledge Interactive Proofs. Ph.D. Thesis, Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, 1990. Available from http://mm.wisdom.weizmann.ac.il/∼feige.
39. U. Feige and A. Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. In CRYPTO'89, Springer-Verlag (LNCS 435), pages 526-544, 1989.
40. P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. SIAM Journal on Computing, 26(2):873-933, 1997.
41. M. Fischer, N. Lynch, and M. Merritt. Easy Impossibility Proofs for Distributed Consensus Problems. Distributed Computing, 1(1):26-39, 1986.
42. M. Fischlin and R. Fischlin. Efficient Non-malleable Commitment Schemes. In CRYPTO'00, Springer-Verlag (LNCS 1880), pages 413-431, 2000.
43. M. Fitzi, N. Gisin, U. Maurer and O. Von Rotz. Unconditional Byzantine Agreement and Multi-Party Computation Secure Against Dishonest Minorities from Scratch. In EUROCRYPT'02, Springer-Verlag (LNCS 2332), pages 482-501, 2002.
44. M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein and A. Smith. Byzantine Agreement Secure Against Faulty Majorities From Scratch. In 21st PODC, pages 118-126, 2002.
45. M. Fitzi and U. Maurer. From Partial Consistency to Global Broadcast. In 32nd STOC, pages 494-503, 2000.
46. Z. Galil, S. Haber and M. Yung. Cryptographic Computation: Secure Fault Tolerant Protocols and the Public Key Model. In CRYPTO'87, Springer-Verlag (LNCS 293), pages 135-155, 1987.
47. J. Garay and P. Mackenzie. Concurrent Oblivious Transfer. In 41st FOCS, pages 314-324, 2000.
48. O. Goldreich. Foundations of Cryptography: Volume 1 - Basic Tools. Cambridge University Press, 2001.
49. O. Goldreich. Secure Multi-Party Computation. Manuscript, v. 1.4, 2002. Available from http://www.wisdom.weizmann.ac.il/∼oded/pp. html.
50. O. Goldreich. Concurrent Zero-Knowledge With Timing Revisited. In 34th STOC, pages 332-340, 2002.
51. O. Goldreich and A. Kahan. How To Construct Constant-Round Zero-Knowledge Proof Systems for NP. Journal of Cryptology, 9(3):167-190, 1996.
52. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIMA Journal on Computing, 25(1):169-192, 1996.
53. O. Goldreich and L. Levin. A Hard Predicate for All One-way Functions. In 21st STOC, pages 25-32, 1989.
54. O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology, 7(1):1-32, 1994.
55. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM, 38(1):691-729, 1991.
56. (Preliminary version in 27th FOCS, 1986.)
57. O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218-229, 1987. For details see [G02a].
58. 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.
59. S. Goldwasser and Y. Lindell. Secure Computation Without Agreement. In 16th DISC, pages 17-32, 2002.
60. S. Goldwasser, S. Micali and C. Rackoff The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, 18(1):186-208, 1989.
61. (Preliminary version in 17th STOC, 1985.)
62. S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, 1988.
63. L. Gong, P. Lincoln, and J. Rushby. Byzantine Agreement with Authentication: Observations and Applications in Tolerating Hybrid and Link Faults. In Dependable Computing for Critical Applications, pages 139-157, 1995.
64. J.N. Gray. Notes on data base operating systems. In Operating Systems: An Advanced Course, Springer-Verlag (LNCS 60), chapter 3.F, page 465, 1978.
65. J. Kilian. Uses of Randomness in Algorithms and Protocols. The ACM Distinguished Dissertation 1989, MIT press.
66. J. Kilian and E. Petrank. Concurrent and resettable zero-knowledge in poly-logartihmic rounds. In 33rd STOC, pages 560-569, 2001.
67. J. Kilian, E. Petrank and C. Rackoff. Lower Bounds for Zero Knowledge on the Internet. In 39th FOCS, pages 484-492, 1998.
68. L. Lamport, R. Shostack, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
69. L. Lamport. The weak byzantine generals problem. Journal of the ACM, 30(3):668-676, 1983.
70. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In the Journal of Cryptology, 16(3):143-184, 2003.
71. (Preliminary version in CRYPTO'01, 2001.)
72. Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 35th STOC, pages 683-692, 2003.
73. Y. Lindell. General Composition and Universal Composability in Secure Multi-Party Computation. In 44th FOCS, 2003.
74. Y. Lindell, A. Lysysanskaya and T. Rabin. On the Composition of Authenticated Byzantine Agreement. In 34th STOC, pages 514-523, 2002.
75. S. Micali and P. Rogaway. Secure computation. Unpublished manuscript, 1992.
76. Preliminary version in CRYPTO'91, Springer-Verlag (LNCS 576), pages 392-404, 1991.
77. M. Naor. Bit Commitment using Pseudorandom Generators. Journal of Cryptology, 4(2):151-158, 1991.
78. R. Ostrovsky and M. Yung. How to Withstand Mobile Virus Attacks. In 10th PODC, pages 51-59, 1991.
79. R. Pass and A. Rosen Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In 44th FOCS, 2003.
80. M. Pease, R. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. Journal of the ACM, 27(2):228-234, 1980.
81. B. Pfitzmann and M. Waidner. Information-Theoretic Pseudosignatures and Byzantine Agreement for t>=n/3. Technical Report RZ 2882 (#90830), IBM Research, 1996.
82. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. 7th ACM Conference on Computer and Communication Security, pages 245-254, 2000.
83. M. Prabhakaran, A. Rosen and A. Sahai. Concurrent Zero Knowledge With Logarithmic Round Complexity. In 43rd FOCS, pages 366-375, 2002.
84. M. Rabin. How to Exchange Secrets by Oblivious Transfer. Tech. Memo TR-81, Aiken Computation Laboratory, Harvard U., 1981.
85. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multi-party Protocols with Honest Majority. In 21st STOC, pages 73-85, 1989.
86. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EUROCRYPT'99, Springer-Verlag (LNCS 1592), pages 415-413, 1999.
87. R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.
88. A. Rosen. A Note on the Round-Complexity of Concurrent Zero-Knowledge. In CRYPTO'00, Springer-Verlag (LNCS 1880), pages 451-468, 2000.
89. A. Sahai. Non-Malleable Non-Interactive Zero-Knowledge and Adaptive Chosen-Ciphertext Security. In 40th FOCS, pages 543-553, 1999.
90. A. Yao. How to Generate and Exchange Secrets. In 17th FOCS, pages 162-167, 1986.