Cryptographic complexity of multi-party computation problems: Classifications and separations

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

Volumn 5157 LNCS, Issue , 2008, Pages 262-279

  Prabhakaran, Manoj ^a   Rosulek, Mike ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK BOXES; COMMUNICATION CHANNELS; COMPUTATION MODELS; CRYPTOLOGY; IMPOSSIBILITY RESULTS; INTERNAL STRUCTURES; MULTI-PARTY COMPUTATIONS; NEW TOOLS; REALIZABILITY; SECURE FUNCTION EVALUATION; SECURE MULTI-PARTY COMPUTATION;

CHARACTERIZATION; CRYPTOGRAPHY; FUNCTION EVALUATION; FUNCTIONS; MODEL PREDICTIVE CONTROL; PREDICTIVE CONTROL SYSTEMS; SEPARATION; STANDARDS; ULTRASONICS;

CHLORINE COMPOUNDS;

EID: 51849126899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85174-5_15     Document Type: Conference Paper

References (40)

1. Proc. 20th STOC. ACM (1988)
2. Proc. 21st STOC. ACM (1989)
3. Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: Proc. 47th FOCS. IEEE, Los Alamitos (2006)
4. Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: FOCS, pp. 186-195. IEEE, Los Alamitos (2004)
5. Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition using super-polynomial simulation. In: Proc. 46th FOCS. IEEE, Los Alamitos (2005)
6. Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 80-97. Springer, Heidelberg (1999)
7. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th STOC [1], pp. 1-10
8. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067. Revised version of [9]
9. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Electronic Colloquium on Computational Complexity (ECCC) TR01-016 (2001). Previous version A unified framework for analyzing security of protocols, availabe at the ECCC archive TR01-016. Extended abstract in FOCS 2001 (2001)
10. Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392. Springer, Heidelberg (2007)
11. Canetti, R., Fischlin, M.: Universally composable commitments. Report 2001/055, Cryptology ePrint Archive, July 2001. Extended abstract appeared in CRYPTO 2001 (2001)
12. Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656. Springer, Heidelberg (2003)
13. Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptology 19(2), 135-167 (2006)
14. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party computation. In: Proc. 34th STOC, pp. 494-503. ACM, New York (2002)
15. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: Proc. 20th STOC [1], pp. 11-19
16. Chor, B., Ishai, Y.: On privacy and partition arguments. Information and Computation 167(1), 2-9 (2001)
17. Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy (extended abstract). In: STOC [2], pp. 62-72
18. Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM J. Discrete Math. 4(1), 36-47 (1991)
19. Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288-323 (1988)
20. Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: ACM (ed.) Proc. 19th STOC, pp. 218-229. ACM, New York (1987)
21. Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: Ot-combiners via secure computation. In: TCC 2008 (to appear, 2008)
22. Harnik, D., Naor, M., Reingold, O., Rosen, A.: Completeness in two-party secure computation: A computational view. J. Cryptology 19(4), 521-552 (2006)
23. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC, pp. 21-30. ACM, New York (2007)
24. Kalai, Y.T., Lindell, Y., Prabhakaran, M.: Concurrent general composition of secure protocols in the timing model. In: STOC, pp. 644-653. ACM, New York (2005)
25. Kidron, D., Lindell, Y.: Impossibility results for universal composability in public-key models and with fixed inputs. Cryptology ePrint Archive, Report 2007/478 (2007), http://eprint.iacr.org/2007/478
26. Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20-31 (1988)
27. Kilian, J.: A general completeness theorem for two-party games. In: STOC, pp. 553-560. ACM, New York (1991)
28. Kilian, J.: More general completeness theorems for secure two-party computation. In: Proc. 32th STOC, pp. 316-324. ACM, New York (2000)
29. Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM J. Comput. 29(4), 1189-1208 (2000)
30. Kushilevitz, E.: Privacy and communication complexity. In: FOCS, pp. 416-421. IEEE, Los Alamitos (1989)
31. Kushilevitz, E.: Privacy and communication complexity. SIAM J. Discrete Math. 5(2), 273-284 (1992)
32. Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in multiparty private computations. In: FOCS, pp. 478-489. IEEE, Los Alamitos (1994)
33. Lindell, Y.: General composition and universal composability in secure multi-party computation. In: Proc. 44th FOCS. IEEE, Los Alamitos (2003)
34. Lindell, Y.: Lower bounds for concurrent self composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, Springer, Heidelberg (2004)
35. Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: ACM Conference on Computer and Communications Security, pp. 245-254 (2000)
36. Prabhakaran, M.: New Notions of Security. PhD thesis, Department of Computer Science, Princeton University (2005)
37. Prabhakaran, M., Rosulek, M.: Cryptographic complexity of multi-party computation problems: Classifications and separations. Electronic Colloquium on Computational Complexity (ECCC) 15(50) (2008)
38. Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC, pp. 242-251. ACM, New York (2004)
39. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. 21st STOC [2], pp. 73-85
40. Yao, A.C.: Protocols for secure computation. In: Proc. 23rd FOCS, pp. 160-164. IEEE, Los Alamitos (1982)