On combining privacy with guaranteed output delivery in secure multiparty computation

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

Volumn 4117 LNCS, Issue , 2006, Pages 483-500

  Ishai, Yuval ^a   Kushilevitz, Eyal ^a   Lindell, Yehuda ^b   Petrank, Erez ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY; NETWORK PROTOCOLS; SECURITY OF DATA;

DISHONEST MAJORITY; MULTIPARTY COMPUTATION; OUTPUT DELIVERY; SECURITY PROPERTIES;

COMMUNICATION SYSTEMS;

EID: 33749547215     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_29     Document Type: Conference Paper

References (45)

1. N. Asokan, V. Shoup, and M. Waidner. Optimistic Fair Exchange of Digital Signatures (Extended Abstract). In Proc. EUROCRYPT 1998, pages 591-606.
2. B. Barak, and A. Sahai. How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. In Proc. of 46th FOCS, pp. 543-552, 2005.
3. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8th ACM PODC, pages 201-209, 1989.
4. D. Beaver, S. Goldwasser. Multiparty Computation with Faulty Majority. In Proc. of FOCS 1989, pp. 468-473.
5. D. Beaver, S. Micali and P. Rogaway. The Round Complexity of Secure Protocols. In 22nd STOC, pages 503-513, 1990.
6. M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In 20th STOC, pages 1-10, 1988.
7. D. Boneh and M. Naor. Timed Commitments. In CRYPTO 2000, pp. 236-254.
8. C. Cachin and J. Camenisch. Optimistic Fair Secure Computation. In Proc. CRYPTO 2000, pages 93-111.
9. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143-202, 2000.
10. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. FOCS 2001: 136-145.
11. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively Secure Multi-Party Computation. In 28th STOC, pages 639-648, 1996.
12. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494-503, 2002.
13. D. Chaum, C. Crépeau and I. Damgård. Multi-party Unconditionally Secure Protocols. In 20th STOC, pages 11-19, 1988.
14. R. Cleve. Limits on the Security of Coin Flips when Half the Processors Are Faulty. In Proc. of STOC 1986, pp. 364-369.
15. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient Multiparty Computations Secure Against an Adaptive Adversary. In Proc. EUROCRYPT 1999, pages 311-326.
16. R. Cramer, I. Damgård, and S. Fehr. On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase. In Proc. CRYPTO 2001, pages 503-523.
17. R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT '00, pp. 316-334.
18. R. Cramer, I. Damgård, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In EUROCRYPT '01, pp. 280-299.
19. I. Damgård and J. Nielsen. Multiparty Computation from Threshold Homomorphic Encryption. CRYPTO 2003: 247-264.
20. I. Damgård and Y. Ishai. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In CRYPTO 2005, pp. 378-394.
21. S. Even, O. Goldreich and A. Lempel. A Randomized Protocol for Signing Contracts. In Communications of the ACM, 28(6):637-647, 1985.
22. M. Fitzi, M. Hirt, T. Holenstein, and J. Wullschleger. Two-Threshold Broadcast and Detectable Multi-party Computation. EUROCRYPT 2003: 51-67.
23. M. Fitzi, M. Hirt, and U. M. Maurer. Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract). CRYPTO 1998: 121-136
24. M. Fitzi, T. Holenstein, and J. Wullschleger. Multi-party Computation with Hybrid Security. EUROCRYPT 2004: 419-438
25. J. A. Garay, P. D. MacKenzie, and K. Yang. Efficient and Universally Composable Committed Oblivious Transfer and Applications. TCC 2004.
26. J. A. Garay, P. D. MacKenzie, M. Prabhakaran, and K. Yang. Resource Fairness and Composability of Cryptographic Protocols. Proc. 3rd TCC, 2006. Also appears in Cryptology ePrint Archive, Report 2005/370.
27. O. Goldreich. Foundations of Cryptography: Volume 2 - Basic Applications. Cambridge University Press, 2004.
28. 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 [27].
29. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO '90, pp. 77-93.
30. S. Goldwasser, and Y. Lindell. Secure Multi-Party Computation without Agreement. J. Cryptology 18(3): 247-287 (2005).
31. Preliminary version in DISC 2002
32. . [31] M. Hirt and U. M. Maurer. Robustness for Free in Unconditional Multi-party Computation. CRYPTO 2001: 101-118.
33. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st FOCS, pp. 294-304, 2000.
34. J. Katz and R. Ostrovsky. Round-Optimal Secure Two-Party Computation. In CRYPTO 2004, pages 335-354.
35. J. Katz, R. Ostrovsky, and A. Smith. Round Efficiency of Multi-party Computation with a Dishonest Majority. In EUROCRYPT 2003, pages 578-595.
36. M. Lepinski, S. Micali, C. Peikert, and A. Shelat. Completely fair SFE and coalition-safe cheap talk. In Proc. PODC 2004, pages 1-10.
37. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. J. Cryptology 16(3): 143-184 (2003).
38. Preliminary version in Crypto 2001.
39. M. Luby, S. Micali, and C. Rackoff. How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin. In 24th FOCS, pp. 11-21, 1983.
40. R. Pass. Bounded-Concurrent Secure Multi-Party Computation With a Dishonest Majority. In Proc. STOC 2004, pages 232-241.
41. R. Pass and A. Rosen. Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In Proc. FOCS 2003., pp. 404-413, 2005.
42. B. Pfitzmann and M. Waidner. Information-Theoretic Pseudosignatures and Byzantine Agreement for t ≥ n/3. IBM Research Report RZ 2882 (#90830), IBM Research Division, Zurich, 1996.
43. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proc. 21st STOC, pages 73-85. ACM, 1989.
44. A. Shamir. How to share a secret. Commun. ACM, 22(6):612-613, June 1979.
45. A. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162-167, 1986.