Constant-round multiparty computation using black-box pseudorandom generator

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

Volumn 3621 LNCS, Issue , 2006, Pages 378-394

  Damgård, Ivan ^a,b   Ishai, Yuval ^a,b  

^a AARHUS UNIVERSITY   (Denmark)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ADVERSARY; BLACK-BOX PSEUDORANDOM GENERATOR; COMMUNICATION COMPLEXITY; MULTIPARTY COMPUTATION;

CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CRYPTOGRAPHY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA; THEOREM PROVING;

MULTI AGENT SYSTEMS;

EID: 33745124039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (40)

1. B. Applebaum, Y. Ishai, and E. Kushilevitz. Computationally private randomizing polynomials and their applications. In Proc. 20th Conference on Computational Complexity, 2005.
2. 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.
3. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In Proc. of CRYPTO '90.
4. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. of 22nd STOC, pages 503-513, 1990.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. of 20th STOC, pages 1-10, 1988.
6. C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents. In Proceedings of ICALP' 00, 2000.
7. R. Canetti. Security and composition of multiparty cryptographic protocols. In J. of Cryptology, 13(1), 2000.
8. R. Canetti. Ran Canetti. Universally Composable Security. A New Paradigm for Cryptographic Protocols. FOCS 2001: 136-145.
9. R. Cramer and I. Damgård. Secure distributed linear algebra in a constant number of rounds. In Proc. Crypto 2001.
10. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient Multiparty Computations Secure Against an Adaptive Adversary. In Proc. EURO-CRYPT 1999, pages 311-326.
11. R. Cramer, I. Damgård, and Y. Ishai. Share conversion, pseudorandom secret-sharing and applications to secure computation. In Proc. of second TCC, 2005.
12. R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Proc. of EUROCRYPT '00, LNCS 1807, pp. 316-334, 2000.
13. R. Cramer, I. Damgård, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proc. of EUROCRYPT '01, LNCS 2045, pp. 280-299, 2001.
14. U. Feige, A. Fiat, and A. Shamir. Zero-Knowledge Proofs of Identity. J. Cryptology 1(2): 77-94 (1988).
15. Uri Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation (extended abstract). In Proc. 26th STOC, pages 554-563. ACM, 1994.
16. P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. SIAM. J. Computing, 26(2):873-933, 1997.
17. R. Gennaro, Y. Ishai, E. Kushilevitz and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proceedings of the 33rd ACM Symp. on Theory of Computing (STOC '01), pages 580-589, 2001.
18. R. Gennaro, Y. Ishai, E. Kushilevitz and T. Rabin. On 2-round secure multiparty computation. In Proc. Crypto '02.
19. N. Gilboa and Y. Ishai. Compressing cryptographic resources. In Proc. of CRYPTO '99.
20. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game (extended abstract). In Proc. of 19th STOC, pages 218-229, 1987.
21. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4): 1364-1396, 1999.
22. M. Hirt and U. M. Maurer. Robustness for Free in Unconditional Multi-party Computation. CRYPTO 2001: 101-118.
23. 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.
24. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. Proceedings of 21st Annual ACM Symposium on the Theory of Computing, 1989, pp. 44-61.
25. J. Katz and R. Ostrovsky. Round-Optimal Secure Two-Party Computation. In CRYPTO 2004, pages 335-354.
26. J. Katz, R. Ostrovsky, and A. Smith. Round Efficiency of Multi-party Computation with a Dishonest Majority, In EUROCRYPT 2003, pages 578-595.
27. J. Kilian. Founding cryptography on oblivious transfer. In Proc. 20th STOC, pages 20-31, 1988.
28. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. J. Cryptology 16(3): 143-184 (2003). Preliminary version in Crypto 2001.
29. Y. Lindell, A. Lysyanskaya, and T. Rabin. Sequential composition of protocols without simultaneous termination. In Proc. PODC 2002, pages 203-212.
30. Y. Lindell and B. Pinkas. A Proof of Yao's Protocol for Secure Two-Party Computation. Cryptology ePrint Archive, Report 2004/175, 2004.
31. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. STOC 2001, pages 590-599.
32. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. 1st A CM Conference on Electronic Commerce, pages 129-139, 1999.
33. R. Pass. Bounded-concurrent secure multi-party computation with a dishonest majority. In Proc. STOC 2004, pages 232-241.
34. R. Pass and A. Rosen. Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. FOCS 2003.
35. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proc. 21si STOC, pages 73-85. ACM, 1989.
36. O. Reingold, L. Trevisan, and S. P. Vadhan. Notions of Reducibility between Cryptographic Primitives. TCC 2004: 1-20.
37. P. Rogaway. The Round Complexity of Secure Protocols. PhD thesis, MIT, June 1991.
38. A. Shamir. How to share a secret. Commun. ACM, 22(6):612-613, June 1979.
39. S. R. Tate and K. Xu. On garbled circuits and constant round secure function evaluation. CoPS Lab Technical Report 2003-02, University of North Texas, 2003.
40. A. C. Yao. How to generate and exchange secrets. In Proc. 27th FOCS, pp. 162-167, 1986.