Avrim Blum Pittsburgh, Pennsylvania Merrick Furst Pittsburgh, Pennsylvania...  Home/Search
Context Related
| upenn.edu/~mkearns/papers/prim.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~mkearns/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Modern cryptography has had considerable impact on the development of computational learning theory. Tools from cryptography have been used in proving nearly all of the strong negative results for learning. In this paper, we give results in the reverse direction by showing how to construct several cryptographic primitives based on certain assumptions on the difficulty of learning. Thus we develop further a line of thought introduced by Impagliazzo and Levin [5]. (Update)
Cited by: More
A Novel Algorithm for Solving the LPN Problem and - Its Application To (2006) (Correct)
Security Parallels Between People and Pervasive Devices - Stephen Weis Computer (Correct)
From Known-Plaintext to Chosen-Ciphertext Security - Maurer, Sjödin (2006) (Correct)
Similar documents (at the sentence level):
40.0%: Cryptographic Primitives Based on Hard Learning Problems - Blum, Furst, Kearns, Lipton (1994) (Correct)
40.0%: Cryptographic Primitives Based on Hard - Learning Problems Avrim (Correct)
Active bibliography (related documents): More All
0.1: Cryptography and Machine Learning - Ronald Rivest Laboratory (1993) (Correct)
0.0: Survey of Computational Assumptions Used in Cryptography Broken or.. - Zhu (2001) (Correct)
0.0: A New Paradigm for Public Key Identification - Stern (1996) (Correct)
Similar documents based on text: More All
0.2: Weakly Learning DNF and Characterizing Statistical Query Learning.. - Blum (1994) (Correct)
0.2: Weakly Learning DNF and Characterizing Statistical - Query Learning Using (Correct)
0.2: Fast Planning Through Planning Graph Analysis - Blum, Furst (1995) (Correct)
Related documents from co-citation: More All
13: How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1984
10: A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
9: Cryptographic limitations on learning boolean formulae and finite automata - Kearns, Valiant - 1989
BibTeX entry: (Update)
A. Blum, M. Furst, M. Kearns and R. J. Lipton, Cryptographic primitives based on hard learning problems, Advances in Cryptology - CRYPTO '93, LNCS, vol. 773, Springer, 1994, pp. 278-291. http://citeseer.ist.psu.edu/blum94cryptographic.html More
@article{ blum94cryptographic,
author = "Avrim Blum and Merrick Furst and Michael Kearns and Richard J. Lipton",
title = "Cryptographic Primitives Based on Hard Learning Problems",
journal = "Lecture Notes in Computer Science",
volume = "773",
pages = "278--??",
year = "1994",
url = "citeseer.ist.psu.edu/blum94cryptographic.html" }
Citations (may not include all citations):493 Communications of the ACM (context) - Valiant, of et al. - 1984
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
184 Cryptographic limitations on learning Boolean formulae and f.. - Kearns, Valiant - 1989
167 Pseudorandom generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
107 Efficient noise-tolerant learning from statistical queries - Kearns - 1993
82 When won't membership queries help (context) - Angluin, Kharitonov - 1991
73 the inherent intractability of certain coding problems (context) - Berlekamp, McEliece et al. - 1978
37 No better ways to generate hard NP instances than picking un.. (context) - Impagliazzo, Levin - 1990
35 the existence of pseudorandom generators (context) - Goldreich, Krawczyk et al. - 1988
32 Hardness vs (context) - Nisan, Wigderson - 1988
31 Cryptographic hardness of distributionspecific learning (context) - Kharitonov - 1993
12 A Public-Key System Based on Algebraic Coding Theory (context) - McEliece - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~mkearns/): More
Graphical Economics - Sham Kakade Michael (Correct)
Efficient Algorithms for Learning to Play Repeated Games Against.. - al. (1995) (Correct)
On the Boosting Ability of Top-Down Decision Tree Learning.. - Kearns (1996) (Correct)
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