Resource-based corruptions and the combinatorics of hidden diversity

ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science

Volumn , Issue , 2013, Pages 415-428

  Garay, Juan ^a   Johnson, David ^a   Kiayias, Aggelos ^b   Yung, Moti ^c,d  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF ATHENS   (Greece)

^c GOOGLE INC   (United States)

^d Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

combinatorial analysis; cost of corruption; exact hardness; hardness amplification; secure multi party computation

Indexed keywords

ATOMIC OPERATION; CHOICE OF PARAMETERS; COMBINATORIAL ANALYSIS; COMBINATORIAL PROBLEM; COMBINATORICS; CRYPTOGRAPHIC PROTOCOLS; DISCRETIZATIONS; EFFICIENCY GAIN; HARDNESS AMPLIFICATION; IMPOSSIBILITY RESULTS; INDISTINGUISHABILITY; SECURE MULTI-PARTY COMPUTATION; SYSTEM CONFIGURATIONS; TECHNICAL CONTRIBUTION;

BUDGET CONTROL; COMPUTER SCIENCE; CRYPTOGRAPHY; HARDNESS; INFORMATION THEORY; MODEL PREDICTIVE CONTROL;

CRIME;

EID: 84873362733     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2422436.2422482     Document Type: Conference Paper

References (38)

1. Mihir Bellare and Shafi Goldwasser. Verifiable partial key escrow. In Richard Graveman, Philippe A. Janson, Clifford Neumann, and Li Gong, editors, ACM Conference on Computer and Communications Security, pages 78-91. ACM, 1997.
2. Mihir Bellare, Thomas Ristenpart, and Stefano Tessaro. Multi-instance security and its application to password-based cryptography. In Reihaneh Safavi-Naini and Ran Canetti, editors, CRYPTO, volume 7417 of Lecture Notes in Computer Science, pages 312-329. Springer, 2012.
3. Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security, pages 62-73, 1993.
4. Mihir Bellare and Phillip Rogaway. The exact security of digital signatures - how to sign with rsa and rabin. In EUROCRYPT, pages 399-416, 1996.
5. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In Janos Simon, editor, STOC, pages 1-10. ACM, 1988.
6. Dan Boneh and Moni Naor. Timed commitments. In Mihir Bellare, editor, CRYPTO, volume 1880 of Lecture Notes in Computer Science, pages 236-254. Springer, 2000.
7. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Cryptology ePrint Archive, Report 2000/067, December 2005. Latest version at http://eprint.iacr.org/2000/067/.
8. Ran Canetti, Uriel Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Miller [31], pages 639-648.
9. David Chaum, Claude Crépeau, and Ivan Damgard. Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM symposium on Theory of computing, STOC '88, pages 11-19, New York, NY, USA, 1988. ACM.
10. Richard Cleve. Limits on the security of coin flips when half the processors are faulty (extended abstract). In Juris Hartmanis, editor, STOC, pages 364-369. ACM, 1986.
11. Don Coppersmith. Modifications to the number field sieve. J. Cryptology, 6(3):169-180, 1993.
12. Ivan Damgård, Yuval Ishai, and Mikkel Krøigaard. Perfectly secure multiparty computation and the computational overhead of cryptography. In Henri Gilbert, editor, EUROCRYPT, volume 6110 of Lecture Notes in Computer Science, pages 445-465. Springer, 2010.
13. Yevgeniy Dodis. On extractors, error-correction and hiding all partial information. In Theory and Practice in Information-Theoretic Security, 2005. IEEE Information Theory Workshop on, pages 74 -79, oct. 2005.
14. Cynthia Dwork and Moni Naor. Pricing via processing or combatting junk mail. In Ernest F. Brickell, editor, CRYPTO, volume 740 of Lecture Notes in Computer Science, pages 139-147. Springer, 1992.
15. Tomás Feder, Eyal Kushilevitz, Moni Naor, and Noam Nisan. Amortized communication complexity. SIAM J. Comput., 24(4):736-750, 1995.
16. Ephraim Feig and Shmuel Winograd. On the direct sum conjecture. Linear Algebra and its Applications, 63(0):193-219, 1984.
17. Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, and Rafail Ostrovsky. Minimal complete primitives for secure multi-party computation. J. Cryptology, 18(1):37-61, 2005.
18. Juan A. Garay, David Johnson, Aggelos Kiayias, and Moti Yung. Resource-based corruptions and the combinatorics of hidden diversity. IACR Cryptology ePrint Archive, 2012:556, 2012.
19. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, and Ke Yang. Resource fairness and composability of cryptographic protocols. J. Cryptology, 24(4):615-658, 2011.
20. Juan A. Garay and Carl Pomerance. Timed fair exchange of standard signatures (Extended Abstract). In Rebecca N. Wright, editor, Financial Cryptography, volume 2742 of Lecture Notes in Computer Science, pages 190-207. Springer, 2003.
21. Oded Goldreich, Hugo Krawczyk, and Michael Luby. On the existence of pseudorandom generators. SIAM J. Comput., 22(6):1163-1175, 1993.
22. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Alfred V. Aho, editor, STOC, pages 218-229. ACM, 1987.
23. Iftach Haitner, Danny Harnik, and Omer Reingold. Efficient pseudorandom generators from exponentially hard one-way functions. In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, and Ingo Wegener, editors, ICALP (2), volume 4052 of Lecture Notes in Computer Science, pages 228-239. Springer, 2006.
24. Martin Hirt and Ueli M. Maurer. Player simulation and general adversary structures in perfect multiparty computation. J. Cryptology, 13(1):31-60, 2000.
25. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, and Avi Wigderson. Uniform direct product theorems: Simplified, optimized, and derandomized. SIAM J. Comput., 39(4):1637-1665, 2010.
26. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Cryptography from anonymity. In FOCS, pages 239-248. IEEE Computer Society, 2006.
27. Mauricio Karchmer, Ran Raz, and Avi Wigderson. Super-logarithmic depth lower bounds via the direct sum in communication complexity. Computational Complexity, 5(3/4):191-204, 1995.
28. Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, and John M. Pollard. The number field sieve. In Harriet Ortiz, editor, STOC, pages 564-572. ACM, 1990.
29. Hendrik W. Lenstra. Factoring integers with elliptic curves. The Annals of Mathematics, 126(3):649-673, Nov. 1987.
30. Silvio Micali and Rafael Pass. Local zero knowledge. In Jon M. Kleinberg, editor, STOC, pages 306-315. ACM, 2006.
31. Gary L. Miller, editor. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996. ACM, 1996.
32. Noam Nisan and Avi Wigderson. Hardness vs randomness. J. Comput. Syst. Sci., 49(2):149-167, 1994.
33. Ron Rivest, Adi Shamir, and David Wagner. Timed-lock puzzles and timed-release crypto. In MIT/LCS/TR-684, 1996.
34. Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano. Necessary and sufficient assumptions for non-iterative zero-knowledge proofs of knowledge for all np relations. In Ugo Montanari, José D. P. Rolim, and Emo Welzl, editors, ICALP, volume 1853 of Lecture Notes in Computer Science, pages 451-462. Springer, 2000.
35. Alfredo De Santis and Giuseppe Persiano. Zero-knowledge proofs of knowledge without interaction (extended abstract). In FOCS, pages 427-436. IEEE Computer Society, 1992.
36. Adi Shamir. Partial key escrow: A new approach to software key escrow. In Key Escrow Conference, 1995.
37. Victor Shoup. Lower bounds for discrete logarithms and related problems. In EUROCRYPT, pages 256-266, 1997.
38. Andrew Chi-Chih Yao. Theory and applications of trapdoor functions (extended abstract). In FOCS, pages 80-91. IEEE Computer Society, 1982.