Author:
De Santis Alfredo,Di Crescenzo Giovanni,Persiano Guiseppe
Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. Lecture notes on the complexity of some problems in number theory;Angluin,1982
2. Fast probabilistic algorithms for Hamiltonian circuits and matchings;Angluin;J. Comput. System Sci.,1979
3. Perfect zero knowledge in constant rounds;Bellare;Proc. 22th Ann. Symp. on the Theory of Comput.,1990
4. M. Bellare and M. Yung, Certifying cryptographic tools: The case of trapdoor permutations, in: Proc. of CRYPTO'92, to appear.
5. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, S. Micali and P. Rogaway, Everything provable is provable in zero knowledge, in: S. Goldwasser, ed., Advances in Cryptology – CRYPTO 88, Lecture Notes in Computer Science, Vol. 403 (Springer, Berlin) 37–56.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献