Cryptographic hardness of distribution-specific learning

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 372-381

  Kharitonov, Michael ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; CRYPTOGRAPHY; HARDNESS; POLYNOMIAL APPROXIMATION; THRESHOLD ELEMENTS; BOOLEAN ALGEBRA; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES;

BOOLEAN FORMULAE; CONSTANT-DEPTH CIRCUITS; CRYPTOGRAPHIC ASSUMPTIONS; NUMBER OF SAMPLES; SPECIFIC DISTRIBUTION; SPECIFIC LEARNING; THRESHOLD CIRCUITS; UNIFORM DISTRIBUTION;

BOOLEAN ALGEBRA; CRYPTOGRAPHY;

BLUM INTEGERS; BOOLEAN FORMULAS; DISTRIBUTION SPECIFIC LEARNING; RENYI ENTROPY;

EID: 0027187277     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167197     Document Type: Conference Paper

References (26)

1. W. Alexi, B. Chor, O. Goldreich, and C. Schnorr. RSA and Rabin functions:certain parts are as hard as the whole. SIAM J. on Computing, 17:194-209, 1988.
2. D. Angluin. Lecture notes on the complexity of some problems in number theory. Technical report, Yale University, Report No. TR-243, 1982.
3. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
4. D. Angluin and M. Kharitonov. When Won't Membership Queries Help? In Proc. of the 23d STOC, pages 444-454. ACM, 1991.
5. P. W. Beame, S. A. Cook, and H. J. Hoover. Log depth circuits for division and related problems. SIAM J. on Computing, 15:994-1003, 1986.
6. A. Blum. Separating Distribution-Free and Mistake- Bounded Learning Models over the Boolean Domain In Proc. of the 31st FOCS, pages 211-218. IEEE, 1990.
7. L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudo-random number generator. SIAM J. Corn- put., 15:364-383, 1986.
8. J. L. Carter and M. N. Wegman. Universal Classes of Hash Functions. JCSS, 18:143-154, 1979.
9. A. K. Chandra, L. J. Stockmeyer, U. Vishkin. Constant depth reducibility. SIAM J. on Computing, 13:423-432, 1984.
10. M. Furst, J. Jackson, and S. Smith. Improved learning of ACO functions. In Proc. of the 4th COLT, pages 317-325. Morgan Kaufmann, 1991.
11. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM, 33:792-807, 1986.
12. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proc. of the 21st STOC, pages 25-32. ACM, 1989.
13. J. Hastad. Computational limitations for small depth circuits. MIT Press, 1986. Ph.D. thesis.
14. R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random Number Generation from Any One-way Function. In Proc. Slst STOC, pages 12-24. ACM, 1989.
15. M. Kearns and L. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. In Proc. 21st STOC, pages 433-444. ACM, 1989.
16. M. Kharitonov. Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution In Proc. of the 5th COLT. Morgan Kaufmann, 1992.
17. W. LeVeque. Fundamentals of Number Theory. Addison- Wesley, 1977.
18. L. Levin. Manuscript.
19. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform, and learnability. In Proc. of the 30th FOCS, pages 574-579. IEEE, 1989.
20. M. Luby. Pseudo-randomness and Applications. Princeton University Press, to appear.
21. Y. Mansour. An O(nloloS") Learning Algorithm for DNF under the uniform distribution. In Proc. of the 5th COLT. Morgan Kaufmann, 1992.
22. L. Pitt and M. Warmuth. Prediction-preserving reducibility. JCSS, 41:430-467, 1990.
23. J. Reif. On threshold circuits and polynomial computation. In Proc. of the 2d IEEE Structures, pages 118-123. IEEE, 1987.
24. R. E. Schapire. The strength of weak learnability. In Proc. of the 30th FOCS, pages 28-33. IEEE, 1989.
25. L. G. Valiant. A theory of the learnable. C. ACM, 27:11341142, 1984.
26. U. V. Vazirani and V. V. Vazirani. Efficient and secure pseudo-random number generation. In Proc. of the 25th FOCS, pages 458-463. IEEE, 1984.