Cryptographic Primitives Based on Hard Learning Problems

  title={Cryptographic Primitives Based on Hard Learning Problems},
  author={Avrim Blum and Merrick L. Furst and Michael Kearns and Richard J. Lipton},
Modern cryptography has had considerable impact on the development of com putational learning theory Virtually every intractability result in Valiant s model which is representation independent in the sense that it does not rely on an arti cial syntactic restriction on the learning algorithm s hypotheses has at its heart a cryptographic construction In this paper we give results in the reverse direction by showing how to construct several cryptographic primi tives based on certain assumptions… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 257 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 165 extracted citations

258 Citations

Citations per Year
Semantic Scholar estimates that this publication has 258 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…