Author:
Goldreich Oded,Teichner Liav
Publisher
Springer International Publishing
Reference23 articles.
1. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math. 160(2), 781–793 (2004)
2. Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: RSA/Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17, 194–209 (1988)
3. Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd IEEE Symposium on Foundations of Computer Science, pp. 106–115 (2001)
4. Barak, B.: Non-black-box techniques in crypptography. Ph.D. thesis, Weizmann Institute of Science (2004)
5. Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th IEEE Symposium on Foundations of Computer Science, pp. 374–383 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Generic Plaintext Equality and Inequality Proofs;Financial Cryptography and Data Security;2021