On the (non)universality of the one-time pad

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 376-385

  Dodis, Yevgeniy ^a   Spencer, Joel ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ERRORS; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

MESSAGE AUTHENTICATION; PROBABILISTIC ALGORITHMS; SYMMETRIC-KEY ENCRYPTION;

CRYPTOGRAPHY;

EID: 0036957025     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. M. Ajtai, N. Linial. The influence of large coalitions. Combinatorica, 13(2):129-145, 1993.
2. A. Andreev, A. Clementi, J. Rolim, L. Trevisan. Dispersers, deterministic amplification, and weak random sources. In SIAM J. on Comput., 28(6):2103-2116, 1999.
3. C. Bennett, G. Brassard, and J. Robert. Privacy Amplification by public discussion. In SIAM J. on Computing, pp. 17(2):210-229, 1988.
4. J. Bierbrauer, T. Johansson, G. Kabatianskii, B. Smeets. On Families of Hash Functions via Geometric Codes and Concatenation. In Proc. of CRYPTO, pp. 331-342, 1993.
5. M. Blum. Independent unbiased coin-flipsfrom a correclated biased source - a finite state Markov chain. Combinatorica, 6(2):97-108, 1986.
6. L. Carter and M. Wegman. Universal classes of hash functions. In JCSS, vol. 18, pp. 143-154, 1979.
7. B. Chor, J. Friedman, O. Goldreich, J. Håstad, S. Rudich, R. Smolensky. The Bit Extraction Problem or t-resilient Functions. In Proc. of FOCS, pp. 396-407, 1985.
8. B. Chor, O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, 1988.
9. A. Cohen, A. Wigderson. Dispersers, deterministic amplification, and weak random sources. In Proc. of FOCS, pp. 14-19, 1989.
10. Y. Dodis. New Imperfect Random Source with Applications to Coin-Flipping. In Proc. of ICALP, pp. 297-309, 2001.
11. Y. Dodis, A. Sahai and A. Smith. On Perfect and Adaptive Security in Exposure-Resilient Cryptography. In Proc. of EuroCrypt, pp. 301-324, 2001.
12. P. Elias. The Efficient Construction of an Unbiased Random Sequence. Ann. Math. Stat., 43(3):865-870, 1972.
13. J. Friedman. On the Bit Extraction Problem. In Proc. of FOCS, pp. 314-319, 1992.
14. E. Gilbert, F. MacWilliams and N. Sloane. Codes which detect deception. In Bell Systems Technical J., 53:405-424, 1949.
15. T. Helleseth, T. Johansson. Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings. In proc. of CRYPTO, pp. 31-44, 1996.
16. J. Kahn, G. Kalai, N. Linial. The Influence of Variables on Boolean Functions. In Proc. of 30th FOCS, pp. 68-80, 1989.
17. K. Kurosawa, T. Johansson and D. Stinson. Almost k-wise independent sample spaces and their cryptologic applications. In J. of Cryptology, 14:231-253, 2001.
18. D. Lichtenstein, N. Linial, M. Saks. Some Extremal Problems Arising from Discrete Control Processes. Combinatorica, 9:269-287, 1989.
19. J. McInnes, B. Pinkas. On the Impossibility of Private Key Cryptography with Weakly Random Keys. In Proc. of CRYPTO, pp. 421-435, 1990.
20. N. Nisan, A. Ta-Shma. Extracting Randomness: a survey and new constructions. In JCSS, 58(1):148-173, 1999.
21. N. Nisan, D. Zuckerman. Randomness is Linear in Space. In JCSS, 52(1):43-52, 1996.
22. O. Reingold, R. Shaltiel, A. Wigderson. Extracting randomness via repeated condensing. In Proc. of FOCS, 2000.
23. M. Sántha, U. Vazirani. Generating Quasi-Random Sequences from Semi-Random Sources. Journal of Computer and System Sciences, 33(1): 75-87, 1986.
24. C. Shannon. Communication Theory of Secrecy systems. In Bell Systems Technical J., 28:656-715, 1949.
25. G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application. In "Contemporary Cryptology, the Science of Information Integrity", G. J. Simmons, ed., IEEE Press, pp. 441-497, 1992.
26. S. Skiena. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, 1990.
27. D. Stinson. Universal Hashing and Authentication Codes. In Designs, Codes and Cryptography, 4(4):369-380, 1994.
28. L. Trevisan. Construction of Extractors Using PseudoRandom Generators. In Proc. of STOC, pp. 141-148, 1999.
29. L. Trevisan, S. Vadhan. Extracting Randomness from Samplable Distributions. In Proc. of FOCS, 2000.
30. U. Vazirani. Randomness, Adversaries and Computation. PhD Thesis, University of California, Berkeley, 1986.
31. U. Vazirani. Strong Communication Complexity or Generating Quasi-Random Sequences from Two Communicating Semi-Random Sources. Combinatorica, 7(4):375-392, 1987.
32. U. Vazirani, V. Vazirani. Random polynomial time is equal to slightly-random polynomial time. In Proc. of 26th FOCS, pp. 417-428, 1985.
33. G. Vernam. Secret Signaling Systems. US Patent, 1919.
34. J. von Newman. Various techniques used with connection with random digits. In National Bureau of Standards, Applied Math. Series, 12:36-38, 1951.
35. D. Zuckerman. Simulating BPP Using a General Weak Random Source. Algorithmica, 16(4/5):367-391, 1996.