Cryptographic Primitives Based on Hard Learning Problems
- 1 January 1994
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 278-291
- https://doi.org/10.1007/3-540-48329-2_24
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient noise-tolerant learning from statistical queriesPublished by Association for Computing Machinery (ACM) ,1993
- Cryptographic hardness of distribution-specific learningPublished by Association for Computing Machinery (ACM) ,1993
- When won't membership queries help?Published by Association for Computing Machinery (ACM) ,1991
- No better ways to generate hard NP instances than picking uniformly at randomPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Hardness vs. randomnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- On the existence of pseudorandom generatorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- How to construct random functionsJournal of the ACM, 1986
- A theory of the learnableCommunications of the ACM, 1984
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978