Author:
Beigel Richard,Feigenbaum Joan
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference29 articles.
1. M. Abadi, J. Feigenbaum, andJ. Kilian, On Hiding Information from an Oracle,J. Comput. System Sci. 39 (1989), 21?50.
2. L. Adleman, Two Theorems on Random Polynomial Time, inProc. of the 19th Symposium on Foundations of Computer Science (1978), IEEE, 75?83.
3. D. Angluin and D. Lichtenstein,Provable Security of Cryptosystems: A Survey, YALEU/DCS/TR-288, 1983.
4. L. Babai, L. Fortnow, andC. Lund, Nondeterministic Exponential Time has Two-Prover Interactive Protocols,Computational Complexity 1 (1991), 3?40.
5. R. Beigel, M. Bellare, J. Feigenbaum, and S. Goldwasser, Languages that are Easier than their Proofs, inProc. of the 32nd Symposium on Foundations of Computer Science (1991), IEEE, 19?28.
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献