Cryptography from sunspots: How to use an imperfect reference string

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 249-259

  Canetti, Ran ^a   Pass, Rafael ^b   Shelat, Abhi ^c  

^a IBM   (United States)

^b Cornell ^*

^c UNIVERSITY OF VIRGINIA   (United States)

Author keywords

Common reference string; Entropy; Non black box constructions; Setup models; UC security

Indexed keywords

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; LAWS AND LEGISLATION; LEARNING ALGORITHMS; SOLAR ENERGY; THEOREM PROVING; ULTRASONICS;

(I ,J) CONDITIONS; (P ,P ,T) MEASUREMENTS; COMMON REFERENCE STRING (CRS) MODELS; CRS MODELS; GENERAL (CO); MIN ENTROPY; PHYSICAL PHENOMENON; RANDOM SOURCES; SAMPLING ALGORITHMS; SECURE COMPUTATIONS; UNIFOR M DISTRIBUTION; UNIVERSALLY COMPOSABLE (UC) SECURITY;

CRYPTOGRAPHY;

EID: 46749095580     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389497     Document Type: Conference Paper

References (24)

1. B. Barak. How to go beyond the black-box simulation barrier. In FOCS 01, pages 106-115, 2001.
2. B. Barak, R. Canetti, J. B. Nielson, and R. Pass. Universally composable protocols with relaxed setup assumptions. In FOCS 04, pages 186-195, 2004.
3. M. Blum, A. De Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. SIAM J. Computing, 20(6):1084-1118, 1991.
4. M. Blum, P. Feldman, and S. Micali. Non-interactive zero-knowledge and its applications. In STOC 88, pages 103-112, 1988.
5. B. Barak and Goldreich. Universal arguments and their applications. In CCC, pages 194-203, 2002.
6. B. Barak and Y. Lindell. Strict polynomial-time in simulation and extraction. SIAM J. Comput, 33(4):738-818, 2004.
7. M. Blum. How to prove a theorem so no one can claim it. In Proc. of The International Congress of Mathematicians, pages 1444-1451, 1986.
8. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS 01, pages 136-145, 2001.
9. Ran Canetti. Security and composition of cryptographic protocols: A tutorial. Cryptology ePrint Archive, Report 2006/465, 2006.
10. R. Canetti, Y. Dodis, R. Pass, and S. Walfish. Universally composable security with global setup. In TCC, pages 61-85, 2007.
11. R. Canetti and M. Fischlin. Universally composable commitments. In CRYPTO, 2001.
12. R. Canetti, E. Kushilevitz, and Y. Lindell. On the limitations of universally composable two-party computation without set-up assumptions. In EUROCRYPT 03, 2003.
13. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In STOC 02, pages 494-503, 2002.
14. Y. Dodis, S. Ong, M. Prabhakaran, and A. Sahai. On the (im)possibility of cryptography with imperfect randomness. In FOCS 04, pages 196-205, 2004.
15. U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive zero knowledge proofs based on a single random string. In FOCS 90, pages 308-317, 1990.
16. F Forges. Can sunspots replace a mediator? J. of Math. Ec., 17(4):347-368, 1988.
17. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. In CRYPTO, pages 526-544, 1989.
18. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM Jour, on Computing, 25:169-192, 1996.
19. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In STOC 92, pages 723-732, 1992.
20. Y. Lindell. Lower bounds for concurrent self composition. In TCC, pages 203-222, 2004.
21. S. Micali. CS (computationally-sound) proofs. In FOCS 94, pages 436-453, 1994.
22. R. Pass. Bounded-concurrent secure multi-party computation with a dishonest majority. In STOC 04, pages 232-241, 2004.
23. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In STOC 90, pages 387-394, 1990.
24. L. Trevisan and S. Vadhan. Extracting randomness from samplable distributions. In FOCS 00, pages 32-42, 2000.