Author:
Tzeng Wen-Guey,Tzeng Zhi-Jia
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. M. Bellare, P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols”, Proceedings of the First ACM Conference on Computer and Communications Security, pp.62–73, 1993.
2. M. Ben-Or, S. Goldwasser, A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation”, Proceedings of the 20th ACM Symposium on the Theory of Computing, pp.1–10, 1988.
3. Lect Notes Comput Sci;S. Berkovits,1991
4. Lect Notes Comput Sci;R. Blom,1984
5. Lect Notes Comput Sci;C. Blundo,1992
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献