Efficient Perfectly Secure Message Transmission in Synchronous Networks

Information and Computation

Volumn 126, Issue 1, 1996, Pages 53-61

  Sayeed, Hasan Md ^a   Abu Amara, Hosame ^b  

^a INTEL CORPORATION   (United States)

^b UNIVERSITY OF NEVADA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012527611     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0033     Document Type: Article

References (9)

1. Abu-Amara, H. (1993), A fast topology maintenance algorithm for high-bandwidth networks, IEEE/ACM Trans. Networking 1, No. 3, 386-394.
2. Ben-Or, M., Goldwasser, S., and Wigderson, A. (1988), Completeness theorems for non-cryptographic fault-tolerant distributed computation, in "Proc. 20th Annual ACM Symposium on Theory of Computing," pp. 1-10.
3. Chaum, D., Crepeau, C., and Damgard, I. (1988), Multiparty unconditionally secure protocols, in "Proc. 20th Annual ACM Symposium on Theory of Computing," pp. 11-19.
4. Chor, B., Goldwasser, S., Micali, S., and Awerbunch, B. (1985), Verifiable secret sharing and achieving simultaneity in the presence of faults, in "Proc. 26th Symposium on Foundations of Computer Science," pp. 383-395.
5. Dolev, D., Dwork, C., Waarts, O., and Yung, M. (1993), Perfectly secure message transmission, J. Assoc. Comput. Machinery 40, No. 1, 17-47.
6. Feldman, P., and Micali, S. (1988), Optimal algorithms for Byzantine agreement, in "Proc. 20th Symposium on Theory of Computing," pp. 148-161.
7. Galil, Z., Haber, S., and Yung, M. (1989), Primitives for designing multi-party protocols from specifications, manuscript.
8. McEliece, R., and Sarwate, D. (1981), On sharing secrets and Reed-Solomon codes, Comm. ACM 24, No. 9, 583-584.
9. Rabin, T., and Ben-Or, M. (1989), Verifiable secret sharing and multi-party protocols with honest majority, in "Proc. 21st Annual ACM Symposium on Theory of Computing," pp. 73-85.