Author:
Blundo Carlo,Galdi Clemente,Persiano Giuseppe
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Safety, Risk, Reliability and Quality,Information Systems,Software
Reference18 articles.
1. Bar-Ilan, J., Beaver, D. Non-cryptographic fault-tolerant computing in a constant number of round of interaction. In: Proceedings of 8th ACM Symposium on Principles of Distributed Computing, pp. 36–44 (1989)
2. Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P. Security with low communication overhead. In: Advances in Cryptology – CRYPTO 90, pp. 62–76 (1990)
3. Beaver, D., Micali, S., Rogaway, P. The round complexity of secure protocols. In: Proceedings of 22nd Symposium on Theory of Computing, pp. 503–513 (1990)
4. Ben-Or, M., Goldwasser, S., Wigderson, A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of 20th Symposium on Theory of Computing, pp. 1–10 (1988)
5. Benaloh J. (1986). Secret sharing homomorphism: Keeping shares of a secret secret. In: Odlyzko A. (eds). Advances in Cryptography – Crypto 86. Lecture Notes in Computer Science, vol. 263, Springer, Berlin Heidelberg New York, pp. 251–260
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献