Exploring the limits of common coins using frontier analysis of protocols

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

Volumn 6597 LNCS, Issue , 2011, Pages 486-503

  Maji, Hemanta K ^a   Ouppaphan, Pichayoot ^a   Prabhakaran, Manoj ^a   Rosulek, Mike ^b  

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

^b UNIVERSITY OF MONTANA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY; RANDOM PROCESSES;

COMMON RANDOMNESS; COMPLEXITY ASSUMPTIONS; DETERMINISTIC FUNCTIONS; GEOMETRIC ANALYSIS; IMPOSSIBILITY RESULTS; OBLIVIOUS TRANSFER PROTOCOLS; SECURE COMPUTATION; SECURE EVALUATIONS;

PROBABILITY DISTRIBUTIONS;

EID: 79953197899     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19571-6_29     Document Type: Conference Paper

References (21)

1. Beaver, D.: Perfect privacy for two-party protocols. In: Feigenbaum, J., Merritt, M. (eds.) Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, vol. 2, pp. 65-77. American Mathematical Society, Providence (1989)
2. Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97-109. Springer, Heidelberg (1995)
3. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC, pp. 103-112. ACM, New York (1988)
4. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Electronic Colloquium on Computational Complexity (ECCC) TR01-016 (2001);
5. Previous version "A unified framework for analyzing security of protocols" availabe at the ECCC archive TR01-016, Extended abstract in FOCS 2001
6. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party computation. In: Proc. 34th STOC, pp. 494-503. ACM, New York (2002)
7. Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy (extended abstract). In: STOC, pp. 62-72. ACM, New York (1989)
8. Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364-369. ACM, New York (1986)
9. Cleve, R., Impagliazzo, R.: Martingales, collective coin flipping and discrete control processes (1993) (manuscript), http://www.cpsc.ucalgary.ca/ ~cleve/pubs/martingales.ps
10. Damgård, I., Nielsen, J.B., Orlandi, C.: On the necessary and sufficient assumptions for UC computation. Cryptology ePrint Archive, Report 2009/247 (2009), http://eprint.iacr.org/
11. Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proc. 30th FOCS, pp. 230-235. IEEE, Los Alamitos (1989)
12. Kilian, J.: More general completeness theorems for secure two-party computation. In: Proc. 32th STOC, pp. 316-324. ACM, New York (2000)
13. Künzler, R., Müller-Quade, J., Raub, D.: Secure computability of functions in the it setting with dishonest majority and applications to long-term security. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 238-255. Springer, Heidelberg (2009)
14. Kushilevitz, E.: Privacy and communication complexity. In: FOCS, pp. 416-421. IEEE, Los Alamitos (1989)
15. Maji, H.K., Ouppaphan, P., Prabhakaran, M., Rosulek, M.: Exploring the limits of common coins using frontier analysis of protocols. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 486-503. Springer, Heidelberg (2011), http://eprint.iacr.org/
16. Maji, H.K., Prabhakaran, M., Rosulek, M.: Complexity of multi-party computation problems: The case of 2-party symmetric secure function evaluation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 256-273. Springer, Heidelberg (2009)
17. Maji, H.K., Prabhakaran, M., Rosulek, M.: Cryptographic complexity classes and computational intractability assumptions. In: Yao, A.C.-C. (ed.) ICS, pp. 266-289. Tsinghua University Press, Beijing (2010)
18. Maji, H.K., Prabhakaran, M., Rosulek, M.: A zero-one law for cryptographic complexity with respect to computational UC security. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 595-612. Springer, Heidelberg (2010)
19. Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 1-18. Springer, Heidelberg (2009)
20. Prabhakaran, M., Rosulek, M.: Cryptographic complexity of multi-party computation problems: Classifications and separations. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 262-279. Springer, Heidelberg (2008)
21. Yao, A.C.: Protocols for secure computation. In: Proc. 23rd FOCS, pp. 160-164. IEEE, Los Alamitos (1982)