Does privacy require true randomness?

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

Volumn 4392 LNCS, Issue , 2007, Pages 1-20

  Bosley, Carl ^a   Dodis, Yevgeniy ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; MESSAGE PASSING; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES;

CRYPTOGRAPHIC PRIMITIVES; PRIVATE-KEY ENCRYPTION; SOURCE SCRIPT;

DATA PRIVACY;

EID: 38049035373     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_1     Document Type: Conference Paper

References (20)

1. Alexander Andreev, Andrea Clementi, Jose Rolim, and Luca Trevisan. Dispersers, deterministic amplification, and weak random sources. SIAM J. on Computing, 28(6):2103-2116, 1999.
2. Benny Chor and Oded Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. on Computing, 17(2):230-261, 1988.
3. Yevgeniy Dodis. Exposure-Resilient Cryptography (PhD Thesis). MIT PhD Thesis, 2000.
4. Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, and Amit Sahai. On the (im)possibility of cryptography with imperfect randomness. In Proc. 45th IEEE FOCS, pages 196-205, 2004.
5. Yevgeniy Dodis, Krzysztof Pietrzak and Bartosz Przydatek. Separating Sources for Encryption and Secret-Sharing. In Proc. Theory of Cryptography Conference (TCC), pages 601-616, 2006.
6. Yevgeniy Dodis and Joel Spencer. On the (non-)universality of the one-time pad. In Proc. 43rd IEEE FOCS, pages 376-388, 2002.
7. Yevgeniy Dodis, Amit Sahai, and Adam Smith. On perfect and adaptive security in exposure-resilient cryptography. In Proc. EUROCRYPT'01, pages 301-324, 2001.
8. Oded Goldreich and Leonid Levin. A Hard-Core Predicate for all One-Way Functions. In Prof. STOC, pp. 25-32, 1989.
9. Jesse Kamp, Anup Rao, Salil Vadhan and David Zuckerman. Deterministic extractors for small-space sources. In Proc of STOC, pp. 691-700, 2006.
10. James L. McInnes and Benny Pinkas. On the impossibility of private key cryptography with weakly random keys. In Proc. CRYPTO'90, pages 421-436, 1990.
11. Ueli Maurer and Stefan Wolf. Privacy amplification secure against active adversaries. In Proc. CRYPTO'97, pages 307-321, 1997.
12. Torben P. Pedersen Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Proc. of CRYPTO, pp. 129-140, 1991.
13. Renato Renner and Stefan Wolf. Unconditional authenticity and privacy from an arbitrary weak secret. In Proc. CRYPTO'03, pages 78-95, 2003.
14. Miklos Santha and Umesh V. Vazirani. Generating quasi-random sequences from semi-random sources. JCSS, 33(1):75-87, 1986.
15. Claude Shannon. Communication Theory of Secrecy systems. In Bell Systems Technical J., 28:656-715, 1949.
16. Gilbert Strang. Linear Algebra and Its Applications. Academic Press, London, 1980.
17. Luca Trevisan and Salil Vadhan. Extracting randomness from samplable distributions. In Proc. 41st IEEE FOCS, pages 32-42, 2000.
18. John von Neumann. Various techniques used in connection with random digits. National Bureau of Standards, Applied Mathematics Series, 12:36-38, 1951.
19. Umesh V. Vazirani and Vijay V. Vazirani. Random polynomial time is equal to slightly-random polynomial time. In Proc. 26th IEEE FOCS, pages 417-428, 1985.
20. David Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16(4/5):367-391, 1996.