On achieving the "best of both worlds" in secure multiparty computation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 11-20

  Katz, Jonathan ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

Secure computation

Indexed keywords

MULTI PARTY COMPUTATION; SECURE COMPUTATION;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; NETWORK PROTOCOLS; POLYNOMIALS;

SECURITY OF DATA;

EID: 35448952561     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250793     Document Type: Conference Paper

References (27)

1. D. Beaver. Multiparty Protocols Tolerating Half Faulty Processors. Crypto '89.
2. D. Beaver and S. Goldwasser. Multiparty Computation with Faulty Majority. FOCS '89.
3. D. Beaver, S. Micali, and P. Rogaway. The Round Complexity of Secure Protocols. STOC '90.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. STOC '88.
5. D. Boneh and M. Naor. Timed Commitments. Crypto 2000.
6. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. J. Cryptology 13(1): 143-202, 2000.
7. D. Chaum, C. Crépeau, and I. Damgàrd. Multiparty Unconditionally-Secure Protocols. STOC '88.
8. R. Cleve. Limits on the Security of Coin Flips when Half the Processors are Faulty. STOC '86.
9. R. Cleve. Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. Crypto '89.
10. S. Even, O. Goldreich, and A. Lempel. A Randomized Protocol for Signing Contracts. Comm. ACM 28(6): 637-647, 1985.
11. M. Fitzi, M. Hirt, and U. Maurer. Trading Correctness for Privacy in Unconditional Multiparty Computation. Crypto '98.
12. M. Fitzi, M. Hirt, T. Holenstein, and J. Wullschleger. Two-Threshold Broadcast and Detectable Multiparty Computation. Eurocrypt 2003.
13. M. Fitzi, M. Hirt, and J. Wullschleger. Multiparty Computation with Hybrid Security. Eurocrypt 2004.
14. J. Garay, P. MacKenzie, M. Prabhakaran, and K. Yang. R-esource Fairness and Composability of Cryptographic Protocols. TCC 2006.
15. O. Goldreich. Foundations of Cryptography, vol. 2: Basic Applications. Cambridge University Press, 2004.
16. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. STOC '87.
17. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. Crypto '90.
18. S. Goldwasser and Y. Lindell. Secure Multiparty Computation without Agreement. J. Cryptology 18(3): 247-287, 2005.
19. Y. Ishai, E. Kushilevitz, Y. Lindell, and E. Petrank. On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. Crypto 2006.
20. J. Katz. On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. Available at http://eprint.iacr.org/2006/455.
21. J. Katz, R. Ostrovsky, and A. Smith. Round Efficiency of Multi-Party Computation with a Dishonest Majority. Eurocrypt 2003.
22. M. Luby, S. Micali, and C. Rackoff. How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin. FOCS '83.
23. R. Pass. Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. STOC 2004.
24. B. Pinkas. Fair Secure Two-Party Computation. Eurocrypt 2003.
25. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. STOC '89.
26. A. Shamir. How to Share a Secret. Comm. ACM 22(6):612-613, 1979.
27. A. Yao. How to Generate and Exchange Secrets. FOCS '86.