Complete fairness in secure two-party computation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 413-422

  Dov Gordon, S ^a   Hazay, Carmit ^b   Lindell, Yehuda ^b   Katz, Jonathan ^a  

^a University of Maryland ^*

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Cryptography; Fairness; Secure computation

Indexed keywords

DESIRABLE PROPERTIES; FAIRNESS; SECURE COMPUTATION; SECURE COMPUTATIONS; SECURE PROTOCOLS; SECURITY PROPERTIES;

CRYPTOGRAPHY; PROBABILITY DENSITY FUNCTION;

BOOLEAN FUNCTIONS;

EID: 57049135299     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. D. Beaver. Foundations of Secure Interactive Computing. In Crypto '91, Springer-Verlag (LNCS 576), pages 377-391, 1991.
2. D. Beaver. Secure Multi-Party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority. Journal of Cryptology 4(2):75-122, 1991.
3. D. Beaver and S. Goldwasser. Multiparty Computation with Faulty Majority. In 30th FOCS, pages 468-473, 1989.
4. A Beimel, T. Malkin, and S. Micali. The AU-or-Nothing Nature of Two-Party Secure Computation. In Crypto '99, Springer-Verlag (LNCS 1666), pages 80-97, 1999.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In 20th STOC, pages 1-10, 1988.
6. D. Boneh and M. Naor. Timed Commitments. In Crypto 2000, Springer-Verlag (LNCS 1880), pages 236-254, 2000.
7. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1): 143-202, 2000.
8. D. Chaum, C. Crépeau, and I. Damg̊ard. Multi-party Unconditionally Secure Protocols. In 20th STOC, pages 11-19, 1988.
9. B. Chor and E. Kushilevitz. A Zero-One Law for Boolean Privacy. SIAM Journal of Discrete Math 4(l):36-47, 1991.
10. R. Cleve. Limits on the Security of Coin Flips when Half the Processors are Faulty. In 18th STOC, pages 364-369, 1986.
11. D. Dolev and H. Strong. Authenticated Algorithms for Byzantine Agreement. SIAM Journal on Computing, 12(4):656-666, 1983.
12. S. Even, O. Goldreich, and A. Lempel. A Randomized Protocol for Signing Contracts. Communications of the ACM 28(6):637-647, 1985.
13. 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, 1988.
14. J. Garay, P. MacKenzie, M. Prabhakaran, and K. Yang. Resource Fairness and Composability of Cryptographic Protocols. In 3rd TCC, Springer-Verlag (LNCS 3876), pages 404-428, 2006.
15. O. Goldreich. Foundations of Cryptography: Volume 2. 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. In 19th STOC, pages 218-229, 1987.
17. 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.
18. S.D. Gordon and J. Katz. Complete Fairness in Multi-Party Computation Without an Honest Majority. Manuscript in submission.
19. J. Kilian. A General Completeness Theorem for Two-Party Games. In 23rd STOC, pages 553-560, 1991.
20. J. Kilian. More General Completeness Theorems for Secure Two-Party Computation. In 32nd STOC, pages 316-324, 2000.
21. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. Journal of Cryptology 16(3): 143-184, 2003.
22. M. Luby, S. Micali and C. Rackoff. How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin. In 24th FOCS, pages 11-21, 1983.
23. S. Micali and P. Rogaway. Secure Computation. Unpublished manuscript, 1992. Preliminary version in Crypto '91, Springer-Verlag (LNCS 576), pages 392-404, 1991.
24. M. Pease, R. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. Journal of the ACM 27(2):228-234, 1980.
25. B. Pinkas. Fair Secure Two-Party Computation. In Eurocrypt 2003, Springer-Verlag (LNCS 2656), pages 87-105, 2003.
26. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multi-party Protocols with Honest Majority. In 21st STOC, pages 73-85, 1989.
27. A. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162-167, 1986.