Evaluation may be easier than generation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 74-83

  Naor, Moni ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA PROCESSING; MATHEMATICAL MODELS; PATTERN RECOGNITION; PROBABILITY; STATISTICS;

CLASS OF DISTRIBUTIONS; DISTRIBUTION-FREE; EFFICIENT LEARNING;

PROBABILITY DISTRIBUTIONS; LEARNING SYSTEMS;

EVALUATOR; GENERATOR;

EID: 0029711243     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237833     Document Type: Conference Paper

References (32)

1. D. Angluin and M. Kharitonov, When won't membership queries help, Proc. 23rd ACM Annual Symposium on the Theory of Computing, 1991, pp. 444-454.
2. E. Bach, How to generate factored random numbers, SIAM J. Computing 17, 1988, 179-193.
3. Bellare, M. and S. Goldwasser, New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs, Advances in Cryptology - CRYPTO 89, Lecture Notes in Computer Science, vol. 435, Springer-Verlag, 1990, pp. 194-211.
4. M. Bellare and S. Micali, How to Sign Given Any Trapdoor Function, Proc. 20th ACM Annual Symposium on the Theory of Computing, 1988, pp. 32-42.
5. A. Blum, Separating distribution-free and mistakebound learning models over the Boolean domain, Proc. 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 211-218.
6. A. Blum, M. Furst, M. Kearns, and R. Lipton. Cryptographic Primitives Based on Hard Learning Problems. Advances in Cryptology - CRYPTO 93, Lecture Notes in Computer Science 773, Springer-Verlag, 1994, pp. 278-291.
7. M. Blum, A. De Santis, S. Micali and, G. Persiano, Non-Interactive Zero-Knowledge, SIAM J. Computing, 1991, pp. 1084-1118.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley, 1991.
9. C. Dwork and M. Naor, An Efficient Existentially Unforgeable Signature Scheme and its Applications, Advances in Cryptology - CRYPTO'94, Springer Verlag, 1994, pp. 234-246.
10. S. Even, O. Goldreich, and S. Micali, Online/Off-line Digital Signatures, Advances in Cryptology - CRYPTO'89, Lecture Notes in Computer Science, vol. 435, Springer-Verlag, 1990, pp. 263-275.
11. U. Feige, D. Lapidot and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, Proc. of 31st Symposium on Foundations of Computer Science, 1990, pp. 308-317.
12. Y. Freund, An improved boosting algorithm and its implication on learning complexity, Proc. 5th ACM Workshop on Computational Learning Theory, 1992, pp. 391-398.
13. Goldreich, O., Foundations of Cryptography (Fragments of a Book) 1995. Available in the Electronic Colloquium on Computational Complexity: http://www.eccc.unitrier.de/eccc/info/ECCC-Books/ecccbooks.html.
14. O. Goldreich, Two remarks concerning the Goldwasser-Micali-Rivest signature scheme, Advances in Cryptology - CRYPTO' 86, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, 1987, pp. 104-110.
15. O. Goldreich, S. Goldwasser and S. Micali, How to construct random functions, J. of the ACM. 33 (1986) 792-807.
16. S. Goldwasser, S. Micali and R. Rivest A secure digital signature scheme, SIAM J. on Computing 17, 1988, pp. 281-308.
17. M. Kearns and L. Valiant, Cryptographic limitations on learning Boolean formulae and finite automata, J. of the ACM. 41 (1) (Jan, 1994) 67-95.
18. M. Kearns, Yishai Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire and Linda Sellie, On the learnability of discrete distributions, Proc. 26th ACM Annual Symposium on the Theory of Computing, 1994, pp. 273-282.
19. M. Kharitonov, Cryptographic hardness of distribution-specific learning, Proc. 25th ACM Symposium on Theory of Computing, (1993) 372-381.
20. J. Kilian, On the complexity of boundedinteraction and non-interactive zero-knowledge proofs, Proc. of the 35th IEEE Symposium on the Foundation of Computer Science, 1994.
21. J. Kilian and E. Petrank, An efficient non-interactive zero-knowledge proof system for NP with general assumptions, Electronic Colloquium on Computational Complexity TR95-038. Available: http://www.eccc.unitrier.de/eccc/info/ECCC
22. K. Mulmuley, U. V. Vazirani and V. V. Vazirani Matching is as easy as matrix inversion, Combinatorica 7, 1987, 105-113.
23. M. Naor, Bit commitment using pseudo-randomness, Journal of Cryptology, vol 4, 1991, pp. 151-158.
24. M. Naor and O. Reingold, Synthesizers and their applications Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 170-181.
25. M. Naor and M. Yung, Universal one-Way hash functions and their cryptographic applications, Proc. 21st ACM Annual Symposium on the Theory of Computing, 1989, pp. 33-43.
26. M. Naor and M. Yung, Public key cryptosystems provably secure against chosen ciphertext attacks, Proc. 22nd ACM Annual Symposium on the Theory of Computing, 1990, pp. 427-437.
27. Rivest, R. L., A. Shamir, and L. M. Adleman, A method for obtaining digital signature and public key cryptosystems, Comm. ACM 21 (1978) 120-126.
28. Rivest, R. L., Cryptography and Machine Learning, Proc. ASIACRYPT'91, Springer Verlag, 1993, pp. 427-439.
29. J. Rompel, One-way Function are Necessary and Sufficient for Signatures, Proc. 22nd ACM Annual Symposium on the Theory of Computing, 1990, pp. 387-394.
30. R. E. Schapire, The strength of weak learnability, Machine Learning 5, 1990, pp. 197-227.
31. A. Sinclair and M. Jerrum, Approximate Counting, Uniform Generation, and Rapidly Mixing Markov Chains, Information and Computation, 82:93-133, 1989.
32. L. G. Valiant and V. V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science 47, 1986, pp. 85-93.