Complete Classification of Bilinear Hard-Core Functions

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

Volumn 3152, Issue , 2004, Pages 73-91

  Holenstein, Thomas ^a   Maurer, Ueli ^a   Sjödin, Johan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Goldreich Levin predicate; Hard core functions; List decoding

Indexed keywords

CRYPTOGRAPHY; DECODING; FORWARD ERROR CORRECTION; GOLD;

BILINEAR FUNCTIONS; COMPLETE CLASSIFICATION; GOLDREICH-LEVIN PREDICATE; HARD CORES; LIST DECODING; LIST-DECODABLE CODES; PSEUDO-RANDOM FUNCTIONS; PSEUDORANDOM GENERATORS;

CODES (SYMBOLS);

EID: 35048816448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_5     Document Type: Article

References (16)

1. [ACGS88] Werner Alexi, Benny Chor, Oded Golreich, and Claus P. Schnorr. RSA and Rabin functions: Certain parts are as hard as the whole. Siam Journal on Computation, 17(2): 194-209, 1988.
2. [AGS03] Adi Akavia, Shafi Goldwasser, and Samuel Safra. Proving hard-core predicates using list decoding. In The 44th Annual Symposium on Foundations of Computer Science, pages 146-157, 2003.
3. [BM84] Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. Siam Journal on Computation, 13(4):850-864, 1984.
4. [GL89] Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 25-32, 1989.
5. [Gol01] Oded Goldreich. Basic Tools. Foundations of Cryptography. Cambridge University Press, first edition, 2001. ISBN 0-521-79172-3.
6. [GRS00] Oded Goldreich, Ronitt Rubinfeld, and Madhu Sudan. Learning polynomials with queries: The highly noisy case. Siam Journal on Discrete Mathematics, 13(4):535-570, 2000.
7. [GT00] Rosario Gennaro and Luca Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In The 41st Annual Symposium on Foundations of Computer Science, pages 305-313, 2000.
8. [Has03] Gustav Hast. Nearly one-sided tests and the Goldreich-Levin predicate. In Eli Biham, editor, Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science, pages 195-210, 2003. Extended version to appear in Journal of Cryptology.
9. [HILL99] Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. Siam Journal on Computation, 28(4):1364-1396, 1999.
10. [Lev87] Leonid A. Levin. One-way functions and pseudorandom generators. Combinatorica, 7(4):357-363, 1987.
11. [Lub96] Michael Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, first edition, 1996. ISBN 0-691-02546-0.
12. [Nas95] Mats Näslund. Universal hash functions & hard core bits. In Louis C. Guillou and Jean-Jacques Quisquater, editors, Advances in Cryptology - EUROCRYPT '95, volume 921 of Lecture Notes in Computer Science, pages 356-366, 1995.
13. [Nas96] Mats Näslund. All bits in ax + b mod p are hard. In Neal Koblitz, editor, Advances in Cryptology - CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 114-128, 1996. Extended Abstract.
14. [STV01] Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62(2):236-266, 2001.
15. [Sud00] Madhu Sudan. List decoding: Algorithms and applications. SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 31(1):16-27, 2000.
16. [Yao82] Andrew C. Yao. Theory and applications of trapdoor functions (extended abstract). In The 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, 1982.