Cryptography and Machine Learning

This paper gives a survey of the relationship between the fields of cryptography and machine learning, with an emphasis on how each field has contributed ideas and techniques to the other. Some suggested directions for future cross-fertilization are also proposed.

[1]  Martin E. Hellman,et al.  A cryptanalytic time-memory trade-off , 1980, IEEE Trans. Inf. Theory.

[2]  Philip M. Long,et al.  Tracking drifting concepts using random examples , 1991, Annual Conference Computational Learning Theory.

[3]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[4]  Ronald L. Rivest,et al.  Learning complicated concepts reliably and usefully , 1988, Annual Conference Computational Learning Theory.

[5]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[6]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[7]  Dana Angluin,et al.  When won't membership queries help? , 1991, STOC '91.

[8]  Leonard Pitt,et al.  The minimum consistent DFA problem cannot be approximated within and polynomial , 1989, STOC '89.

[9]  David Haussler,et al.  Proceedings of the fifth annual workshop on Computational learning theory , 1992, COLT 1992.

[10]  David Haussler,et al.  Occam's Razor , 1987, Inf. Process. Lett..

[11]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[12]  Solomon Kullback,et al.  Statistical Methods in Cryptanalysis , 1976 .

[13]  Robert E. Schapire,et al.  Design and analysis of efficient learning algorithms , 1992, ACM Doctoral dissertation award ; 1991.

[14]  Dana Angluin,et al.  A Note on the Number of Queries Needed to Identify Regular Languages , 1981, Inf. Control..

[15]  Adi Shamir,et al.  A TcS2 = 0 (2n) time/space tradeoff for certain NP-complete problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[16]  Leonard Pitt,et al.  Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..

[17]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[18]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[19]  Ryszard S. Michalski,et al.  Machine learning: an artificial intelligence approach volume III , 1990 .

[20]  Ronald L. Rivest,et al.  Cryptography , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[21]  Thomas R. Hancock,et al.  Learning 2µ DNF Formulas and kµ Decision Trees , 1991, COLT.

[22]  Robert E. Schapire,et al.  Learning probabilistic read-once formulas on product distributions , 1991, COLT '91.

[23]  John R. Anderson,et al.  MACHINE LEARNING An Artificial Intelligence Approach , 2009 .

[24]  AARON D. WYNER.  An analog scrambling scheme which does not expand bandwidth, Part II: Continuous time , 1979, IEEE Trans. Inf. Theory.

[25]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[26]  Yishay Mansour,et al.  Learning monotone ku DNF formulas on product distributions , 1991, COLT '91.

[27]  M.E. Hellman,et al.  Privacy and authentication: An introduction to cryptography , 1979, Proceedings of the IEEE.

[28]  Moni Naor,et al.  Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.

[29]  Aaron D. Wyner.  An analog scrambling scheme which does not expand bandwidth, Part I: Discrete time , 1979, IEEE Trans. Inf. Theory.

[30]  Michael Kearns,et al.  Computational complexity of machine learning , 1990, ACM distinguished dissertations.

[31]  Kurt Mehlhorn,et al.  Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity , 1990 .

[32]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[33]  Marek Karpinski,et al.  Learning read-once formulas using membership queries , 1989, COLT '89.

[34]  N. J. A. Sloane,et al.  Error-Correcting Codes and Cryptography , 1981 .

[35]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

[36]  Donald W. Davies,et al.  Security for computer networks - an introduction to data security in teleprocessing and electronic funds transfer (2. ed.) , 1989, Wiley series in communication and distributed systems.

[37]  Gilles Brassard,et al.  Modern cryptology , 2006 .

[38]  Dorothy E. Denning,et al.  Cryptography and Data Security , 1982 .

[39]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[40]  Sean W. Smith,et al.  Improved learning of AC0 functions , 1991, COLT '91.

[41]  Ronald L. Rivest,et al.  Learning Time-Varying Concepts , 1990, NIPS.

[42]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[43]  Leslie G. Valiant,et al.  Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.

[44]  Eyal Kushilevitz,et al.  Learning decision trees using the Fourier spectrum , 1991, STOC '91.

[45]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

[46]  Marek Karpinski,et al.  Learning read-once formulas with queries , 1993, JACM.