Perfectly secure multiparty computation and the computational overhead of cryptography

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

Volumn 6110 LNCS, Issue , 2010, Pages 445-465

  Damgård, Ivan ^a   Ishai, Yuval ^b,c   Krøigaard, Mikkel ^d  

^a AARHUS UNIVERSITY   (Denmark)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ADVERSARY; ARBITRARY CONSTANTS; ARITHMETIC CIRCUIT; ARITHMETIC OPERATIONS; COMPUTATIONAL OVERHEADS; COMPUTATIONAL RESOURCES; COMPUTATIONAL SECURITY; CRYPTOGRAPHIC ASSUMPTIONS; POLYLOGARITHMIC; SATISFIABILITY; SECURE MULTI-PARTY COMPUTATION; SECURE PROTOCOLS; SECURE TWO-PARTY COMPUTATIONS; ZERO KNOWLEDGE PROOF;

CRYPTOGRAPHY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 77954633629     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13190-5_23     Document Type: Conference Paper

References (29)

1. Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595-618. Springer, Heidelberg (2009)
2. Beerliová-Trubíniová, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213-230. Springer, Heidelberg (2008)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1-10. ACM, New York (1988)
4. Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Short pcps verifiable in polylogarithmic time. In: IEEE Conference on Computational Complexity, pp. 120-134. IEEE Computer Society, Los Alamitos (2005)
5. Benes, V.E.: Optimal rearrangable multistage connecting networks. The Bell System Technical Journal 43, 1641-1656 (1964)
6. Bracha, G.: An O(log n) expected rounds randomized byzantine generals protocol. J. ACM 34(4), 910-920 (1987)
7. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, Washington, DC, USA, pp. 136-145. IEEE Computer Society, Los Alamitos (2001)
8. Chaum, D., Crépeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 11-19. ACM, New York (1988)
9. Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multiparty computations over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521-536. Springer, Heidelberg (2006)
10. Cramer, R., Damgård, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280-299. Springer, Heidelberg (2001)
11. Damgård, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501-520. Springer, Heidelberg (2006) (Pubitemid 44532135)
12. Damgård, I., Ishai, Y., Krøigaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. Cryptology ePrint archive, report 2010/131 (2010), http://eprint.iacr.org/
13. Damgård, I., Ishai, Y., Krøigaard, M., Nielsen, J.B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 241-261. Springer, Heidelberg (2008)
14. Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: STOC, pp. 699-710. ACM, New York (1992)
15. Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: PODC 1998: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pp. 101-111. ACM, New York (1998)
16. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 1909: Proceedings of the 41st annual ACM symposium on Theory of computing, pp. 169-178. ACM, New York (2009)
17. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229. ACM, New York (1987)
18. Hirt, M., Maurer, U.M.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptology 13(1), 31-60 (2000)
19. Hirt, M., Maurer, U.M., Przydatek, B.: Efficient secure multi-party computation. In: ASIACRYPT 2000: Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security, London, UK, pp. 143-161. Springer, Heidelberg (2000)
20. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 21-30. ACM, New York (2007)
21. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: STOC 2008: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 433-442. ACM, New York (2008)
22. Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572-591. Springer, Heidelberg (2008)
23. Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC 1992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp. 723-732. ACM, New York (1992)
24. Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol. 4052, pp. 144-155. Springer, Heidelberg (2006)
25. Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253-1298 (2000)
26. Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145-166. Springer, Heidelberg (2006)
27. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC 1989: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 73-85. ACM, New York (1989)
28. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612-613 (1979)
29. Waksman, A.: A permutation network. J. ACM 15(1), 159-163 (1968)