Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In proceedings of STOC '89, pages 25--32, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail (Correct)
No context found.
Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In proceedings of STOC '89, pages 25--32, 1989.
Cryptography in the Multi-string Model - Jens Groth Rafail (Correct)
No context found.
Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way functions. In proceedings of STOC '89, pages 25--32, 1989. 24
A Stronger Definition for - Anonymous Electronic Cash (2006) (Correct)
No context found.
O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In 21st ACM Symposium on the Theory of Computing -- STOC, pages 25--32. ACM Press, 1989.
MV3: A new word based stream cipher using - Rapid Mixing And (2006) (Correct)
No context found.
O. Goldreich and L. Levin, A Hard-Core Predicate for all One-Way Functions, Proc. of STOC'89, pp. 25--32, 1989.
On the (Im-)Possibility of Extending Coin Toss - Hofheinz, Müller-Quade, Unruh (2006) (Correct)
No context found.
O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In STOC '89: Proceedings of the twenty- rst annual ACM symposium on Theory of computing, pages 2532, New York, NY, USA, 1989. ACM Press.
Using Probabilistic I/O Automata to Analyze an.. - Canetti, Cheung.. (2005) (Correct)
No context found.
O. Goldreich, L. A. Levin. A Hard-Core Predicate for all One-Way Functions. 21st Symposium on Theory of Computing (STOC), ACM, 1989, pp. 25-32.
Invariant Signatures and - Non-Interactive Zero-Knowledge Proofs (Correct)
No context found.
Goldreich, O., and L. Levin "A Hard-Core Predicate for all One-Way Functions" Proc. 21st STOC, 1989, pp.25-32.
Non-Interactive and Non-Malleable Commitment - Giovanni Di Crescenzo (1998) (5 citations) (Correct)
No context found.
S. Goldreich and L. Levin, A Hard-Core Predicate for all OneWay Functions, in Proc. of FOCS 89.
Lower Bounds on the Efficiency of Generic - Cryptographic Constructions.. (2000) (Correct)
No context found.
O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of the 21st ACM Symposium on Theory of Computing, pages 25--32, 1989.
One-Way Functions, Hard on Average Problems, and Statistical.. - Ostrovsky (2 citations) (Correct)
No context found.
Goldreich, O., and L. Levin "A Hard-Core Predicate for all One-Way Functions" Proc. 21st STOC, 1989, pp.25-32.
Efficient Search for Approximate Nearest Neighbor in.. - Kushilevitz.. (1998) (40 citations) (Correct)
No context found.
O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proc. 21st STOC, pp. 25--32. ACM, 1989.
Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001) (38 citations) (Correct)
No context found.
O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In 21st Annual ACM Symposium on Theory of Computing, pages 25-32, 1989.
A Verifiable Random Function with Short Proofs and Keys - Dodis, Yampolskiy (2004) (5 citations) (Correct)
No context found.
Oded Goldreich and Leonid Levin. A hard-core predicate for all one-way functions. In Proceedings of the 21th Annual ACM Symposium on the Theory of Computing, pages 25-32, 1989.
Statistical Zero-Knowledge Arguments for NP Using.. - Haitner, Shaltiel (2004) (Correct)
No context found.
O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In ACM, editor, Proceedings of the twenty-first annual ACM Symp. on Theory of Computing, 16 Seattle, Washington, May 15--17, 1989, pages 25--32, New York, NY, USA, 1989. ACM Press.
One-Way Functions are Essential for Non-Trivial.. - Ostrovsky, Wigderson (2002) (34 citations) (Correct)
No context found.
O. Goldreich, and L. Levin "A Hard-Core Predicate for all One-Way Functions" STOC, 89, pp.25-32.
Hierarchical Group Signatures - Trolin, Wikström (2004) (Correct)
No context found.
O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In 21st ACM Symposium on the Theory of Computing (STOC), pages 25--32. ACM Press, 1989.
Nonuniform Hard Boolean Functions and Uniform Complexity Classes - Kabanets (2001) (Correct)
No context found.
O. Goldreich and L.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.
Complete Classification of Bilinear Hard-Core - Functions Thomas Holenstein (Correct)
No context found.
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.
The Role of Latin Square in Cipher Systems: - Matrix Approach To (Correct)
No context found.
O. Goldreich and L. A. Levin. A Hard-Core Predicate for all One-Way Functions. In Symposium on the Theory of Computation (STOC), pages 25--32, 1989.
On Protocol Security in the Cryptographic Model - Nielsen (2003) (1 citation) (Correct)
No context found.
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, Seattle, Washington, 15--17 May 1989.
Lecturer: Madhu Sudan Scribe: Ryan O'Donnell - Error Correcting Codes (Correct)
No context found.
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, Seattle, Washington, 15-17 May 1989.
Lower Bounds on the Efficiency of Encryption and Digital.. - Gennaro, Gertner, Katz (2003) (Correct)
No context found.
O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. STOC '89.
Power from Random Strings - Allender, Koucky, Ronneburger (2001) (1 citation) (Correct)
No context found.
O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In ACM Symposium on Theory of Computing (STOC), pages 25--32, 1989.
Fast Correlation Attacks through Reconstruction of Linear.. - Johansson, Jönsson (2000) (9 citations) (Correct)
No context found.
O. Goldreich and L.A. Levin, A hard-core predicate for all one-way functions, Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, Seattle, Washington, 15-17 May 1989, pp. 2532.
Some Applications of Coding Theory in Computational Complexity - Trevisan (2004) (Correct)
No context found.
O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of the 21st ACM Symposium on Theory of Computing, pages 25--32, 1989. 43
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC