Efficient multiparty protocols via log-depth threshold formulae (Extended abstract)

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

Volumn 8043 LNCS, Issue PART 2, 2013, Pages 185-202

  Cohen, Gil ^a   Damgård, Ivan Bjerre ^b   Ishai, Yuval ^c   Kölker, Jonas ^b   Miltersen, Peter Bro ^b   Raz, Ran ^a   Rothblum, Ron D ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b AARHUS UNIVERSITY   (Denmark)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC STRUCTURES; CRYPTOGRAPHIC ASSUMPTIONS; EFFICIENT PROTOCOLS; EXPLICIT CONSTRUCTIONS; MULTI-PARTY PROTOCOLS; POINT-TO-POINT CHANNELS; SECURE MULTI-PARTY COMPUTATION; THRESHOLD FUNCTIONS;

ALGEBRA; MODEL PREDICTIVE CONTROL; THRESHOLD LOGIC;

CRYPTOGRAPHY;

EID: 84884479881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40084-1_11     Document Type: Conference Paper

References (42)

1. Ajtai, M., Komlós, J., Szemerédi, E.: An o(n log n) sorting network. In: STOC, pp. 1-9 (1983)
2. Akers, S., Robbins, T.: Logical design with three-input majority gates. Computer Design 45(3), 12-27 (1963)
3. Barkol, O., Ishai, Y., Weinreb, E.: On locally decodable codes, self-correctable codes, and t-private PIR. Algorithmica 58(4), 831-859 (2010)
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1-10 (1988)
5. Bracha, G.: An O(log n) expected rounds randomized byzantine generals protocol. J. ACM 34(4), 910-920 (1987)
6. Bro Miltersen, P.: Lecutre notes. Available from author (1992)
7. Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology 13(1), 143-202 (2000)
8. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136-145 (2001)
9. Chaum, D.: The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptograhically from majorities. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 591-602. Springer, Heidelberg (1990)
10. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11-19 (1988)
11. Considine, J., Fitzi, M., Franklin, M.K., Levin, L.A., Maurer, U.M., Metcalf, D.: Byzantine agreement given partial broadcast. J. Cryptology 18(3), 191-217 (2005)
12. Cramer, R., Damgård, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing - An Information Theoretic Appoach (2012), Book draft, available at http://www.daimi.au.dk/~ivan/MPCbook.pdf
13. Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 596-613. Springer, Heidelberg (2003)
14. 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)
15. Desmedt, Y., Pieprzyk, J., Steinfeld, R.: Active security in multiparty computation over black-box groups. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 503-521. Springer, Heidelberg (2012)
16. Desmedt, Y., Pieprzyk, J., Steinfeld, R., Sun, X., Tartary, C., Wang, H., Yao, A.C.-C.: Graph coloring applied to secure computation in non-abelian groups. J. Cryptology 25(4), 557-600 (2012)
17. Desmedt, Y., Pieprzyk, J., Steinfeld, R., Wang, H.: On secure multi-party computation in black-box groups. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 591-612. Springer, Heidelberg (2007)
18. Dolev, D.: The byzantine generals strike again. J. Algorithms 3(1), 14-30 (1982)
19. Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC, pp. 554-563 (1994)
20. Fitzi, M., Maurer, U.M.: Efficient byzantine agreement secure against general adversaries. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 134-148. Springer, Heidelberg (1998) (Pubitemid 128145795)
21. Fitzi, M., Maurer, U.M.: From partial consistency to global broadcast. In: STOC, pp. 494-503 (2000)
22. Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement for n > 3t processors in t + 1 rounds. SIAM J. Comput. 27(1), 247-290 (1998)
23. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, New York (2004)
24. Goldreich, O.: Valiant's polynomial-size monotone formula for majority (2011), http://www.wisdom.weizmann.ac.il/~oded/PDF/mono-maj.pdf
25. 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 (1987)
26. Gupta, A., Mahajan, S.: Using amplification to compute majority with small majority gates. Computational Complexity 6(1), 46-63 (1996)
27. Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 393-411. Springer, Heidelberg (2008)
28. Hirt, M., Maurer, U.M.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptology 13(1), 31-60 (2000)
29. Hoory, S., Magen, A., Pitassi, T.: Monotone circuits for the majority function. In: APPROX-RANDOM, pp. 410-425 (2006)
30. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39(3), 1121-1152 (2009)
31. 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), http://www.cs.illinois.edu/$\ sim$mmp/research.html
32. Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20-31 (1988)
33. Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. SIAM J. Comput. 39(5), 2090-2112 (2010)
34. Lindell, Y., Oxman, E., Pinkas, B.: The IPS compiler: Optimizations, variants and concrete efficiency. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 259-276. Springer, Heidelberg (2011)
35. Lucas, C., Raub, D., Maurer, U.M.: Hybrid-secure mpc: trading information-theoretic robustness for computational privacy. In: PODC, pp. 219-228 (2010)
36. Maurer, U.M.: Secure multi-party computation made simple. Discrete Applied Mathematics 154(2), 370-381 (2006)
37. Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228-234 (1980)
38. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Johnson, D.S. (ed.) STOC, pp. 73-85. ACM (1989)
39. Sun, X., Yao, A.C.-C., Tartary, C.: Graph design for secure multiparty computation over non-abelian groups. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 37-53. Springer, Heidelberg (2008)
40. Valiant, L.G.: Short monotone formulae for the majority function. J. Algorithms 5(3), 363-366 (1984)
41. Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160-164 (1982)
42. Zwick, U.: Lecture notes (1996), http://www.cs.tau.ac.il/~zwick/circ- comp-new/six.ps