Bounded-concurrent secure multi-party computation with a dishonest majority

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 232-241

  Pass, Rafael ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Concurrent composition; Constant round protocols; Secure multi party computation; Simulation sound zero knowledge

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; KNOWLEDGE ACQUISITION; POLYNOMIALS; PROBABILITY; SUPERVISORY AND EXECUTIVE PROGRAMS;

CONCURRENT COMPOSITION; CONSTANT-ROUND PROTOCOLS; SECURE MULTI-PARTY COMPUTATION; SIMULATION-SOUND ZERO-KNOWLEDGE;

NETWORK PROTOCOLS;

EID: 4544250511     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007393     Document Type: Conference Paper

References (38)

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 or Realizing the Shared-Random String Model. In 43rd FOCS, pages 345-355, 2002.
3. B. Barak and O. Goldreich. Universal Arguments and their Applications. 17th CCC, pages 194-203, 2002.
4. B. Barak and Y. Lindell. Strict Polynomial-Time in Simulation and Extraction. In 34th STOC, pages 484-493, 2002.
5. D. Beaver. Foundations of Secure Interactive Computing. In Crypto'91, Springer-Verlag (LNCS 576), pages 377-391, 1991.
6. D. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In 20'th STOC, pages 1-10, 1988.
7. D. Beaver, S. Micali and P. Rogaway The Round Complexity of Secure Protocols. In 22'th STOC, pages 503-513, 1990.
8. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1): 143-202, 2000.
9. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 34th STOC, pages 494-503, 2002.
10. R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable Zero-Knowledge. In 32nd STOC, pages 235-244, 2000.
11. R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. In EuroCrypt'03, Springer LNCS 2656, pages 68-86, 2003.
12. R. Canetti, J. Kilian, E. Petrank and A. Rosen. Black-Box Concurrent Zero-Knowledge Requires (almost) Logarithmically Many Rounds. SIAM Jour. on Computing, Vol. 32(1), pages 1-47, 2002.
13. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multy-Party Computation. In 34th STOC, pages 494-503,2002.
14. B. Chor, M. Rabin. Achieving Independence in Logarithmic Number of Rounds. In 6th PODC, pages 260-268, 1987.
15. I. Damgård. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In EuroCrypt'00, LNCS 1807, pages 418-430, 2000.
16. D. Dolev, C. Dwork and M. Naor. Non-Malleable Cryptography. SIAM Jour. on Computing, Vol. 30(2), pages 391-437, 2000.
17. C. Dwork, M. Naor and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
18. U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416-426, 1990.
19. O. Goldreich. Draft of a Chapter on general Protocols. Available at: http://www.wisdom.weizmann.ac.il/ oded/PSBookFrag/prot.ps
20. O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM Jour. on Computing, Vol. 25(1), pages 169-192, 1996.
21. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM. Vol. 38(1), pp. 691-729, 1991.
22. 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.
23. 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.
24. S. Golwasser and Y. Lindell Secure Computation without Agreement. In 16th DISC, Springer-Verlag (LNCS 2508), pages 17-32, 2002.
25. J. Håstad, R. Impagliazzo, L.A. Levin and M. Luby. A Pseudorandom Generator from any One-way Function. SIAM Jour. on Computing, Vol. 28 (4), pages 1364-1396, 1999.
26. J. Katz, R. Ostrovsky and A. Smith. Round Efficiency of Multi-Party Computation with a Dishonest Majority, In EuroCrypt'03. Springer LNCS 2656 pages 578-595, 2003.
27. Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 35th STOC, pages 683-692, 2003.
28. Y. Lindell. General Composition and Universal Composability in Secure Multi-Party Computation. In 44th FOCS, pages 394-403, 2003
29. Y. Lindell. Lower Bounds for Concurrent Self Composition. In 1st TCC, pages 203-222, 2004.
30. S. Micali and P. Rogaway. Secure computation. Unpublished manuscript, 1992. Preliminary version in Crypto'91, Springer-Verlag (LNCS 576), pages 392-404, 1991.
31. R. Pass. On Deniability in the Common Reference String and Random Oracle Model. In Crypto'03, Springer LNCS 2729, pages 316-337, 2003.
32. R. Pass, A. Rosen. Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In 44th FOCS, pages 404-413, 2003.
33. R. Pass, A. Rosen. New and Improved Constructions of Non-malleable Cryptographic Primitives. Manuscript in preparation.
34. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multi-party Protocols with Honest Majority. In 21st STOC, pages 73-85, 1989.
35. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EuroCrypt'99, Springer LNCS 1592, pages 415-431, 1999.
36. P. Rogaway. The Round Complexity of Secure Protocols. PhD thesis, MIT, 1991.
37. A. Sahai. Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In 40th FOCS, pages 543-553, 1999.
38. A. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162-167, 1986.