On the implementation of huge random objects

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 68-79

  Goldreich, Oded ^a   Goldwasser, Shafi ^a,b   Nussboim, Asaf ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION; FUNCTIONS; GRAPH THEORY; HAMILTONIANS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS;

ERROR CORRECTING CODE; HUGE RANDOM OBJECTS; RANDOM BOUNDED DEGREE GRAPH;

CODES (SYMBOLS);

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

References (24)

1. M. Abadi, E. Allender, A. Broder, J. Feigenbaum, and L. Hemachandra. On Generating Hard, Solved Instances of Computational Problem. In Crypto88, pages 297-310.
2. N. Alon, L. Babai and A. Itai. A fast and Simple Randomized Algorithm for the Maximal Independent Set Problem. J. of Algorithms, Vol. 7, pages 567-583, 1986.
3. E. Bach. Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms. ACM Distinguished Dissertation (1984), MIT Press, Cambridge MA, 1985.
4. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the Theory of Average Case Complexity. JCSS, Vol. 44, No. 2, 1992, pages 193-219. Preliminary version in 21st STOC, 1989.
5. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SICOMP, Vol. 13, pages 850-864, 1984. Preliminary version in 23rd FOCS, 1982.
6. B. Bollobas. Random Graphs. Academic Press, 1985.
7. B. Chor and O. Goldreich. On the Power of Two-Point Based Sampling. Jour. of Complexity, Vol 5, 1989, pages 96-106. Preliminary version dates 1985.
8. I. Damgård. Collision Free Hash Functions and Public Key Signature Schemes. In EuroCrypt'87, Springer-Verlag, LNCS 304, pages 203-216.
9. J. Feigenbaum, S. Kannan, M. Strauss, M. Viswanathan. An Approximate L1-Difference Algorithm for Massive Data Streams. Proceedings of 40th FOCS, pages 501-511, 1999.
10. P. Flajolet and A.M. Odlyzko. Random mapping statistics. In EuroCrypt'89, Springer-Verlag, LNCS, 434, pages 329-354.
11. O. Goldriech. A Note on Computational Indistinguishability. IPL, Vol. 34, pages 277-281, May 1990.
12. O. Goldreich. Foundation of Cryptography - Basic Tools. Cambridge University Press, 2001.
13. O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. JACM, Vol. 33, No. 4, pages 792-807, 1986.
14. O. Goldreich, S. Goldwasser, and A. Nussboim. On the Implementation of Huge Random Objects. ECCC, TR03-045, 2003.
15. O. Goldreich, and H. Krawczyk. On Sparse Pseudorandom Ensembles. Random Structures and Algorithms, Vol. 3, No. 2, (1992), pages 163-174.
16. S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, Vol. 28, No. 2, pages 270-299, 1984. Preliminary version in 14th STOC, 1982.
17. J. Håstad, R. Impagliazzo, L.A. Levin and M. Luby. A Pseudorandom Generator from any One-way Function. SICOMP, Volume28, Number4, pages 1364-1396, 1999. Preliminary versions by Impagliazzo et.al. in 21st STOC (1989) and Håstad in 22nd STOC (1990).
18. R. Impagliazzo and A. Wigderson. P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In 29th STOC, pages 220-229, 1997.
19. D.E. Knuth. The Art of Computer Programming, Addison-Wesley Publishing Company, Inc., 1969 (first edition) and 1981 (second edition).
20. L.A. Levin. Average Case Complete Problems. SICOMP, Vol. 15, pages 285-286, 1986.
21. M. Luby and C. Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SICOMP, Vol. 17, 1988, pages 373-386.
22. M. Naor and O. Reingold. Constructing Pseudo-Random Permutations with a Prescribed Structure, Jour. of Crypto., Vol. 15 (2), 2002, pages 97-102.
23. B. Tsaban. Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation. Journal of Algorithms, Vol. 47 (2), pages 104-121, 2003.
24. A.C. Yao. Theory and Application of Trapdoor Functions. In 23rd FOCS, pages 80-91, 1982.