Reliable communication over partially authenticated networks

Theoretical Computer Science

Volumn 220, Issue 1, 1999, Pages 185-210

  Beimel, Amos ^a   Franklin, Matthew ^b  

^a HARVARD UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Authentication keys; Byzantine failures; Graph connectivity; Private communication; Reliable communication

Indexed keywords

EID: 0346396336     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00241-2     Document Type: Article

References (19)

1. M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computations, in: Proc. 20th Annu. ACM Symp. on the Theory of Computing, 1988, pp. 1-10.
2. J. Carter, M. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979) 143-154.
3. D. Chaum, C. Crepau, I. Damgard, Multiparty unconditionally secure protocols, in: Proc. 20th Annu. ACM Symp. on the Theory of Computing, 1988, pp. 11-19.
4. D. Dolev, The Byzantine generals strike again, J. Algorithms 3 (1982) 14-30.
5. D. Dolev, C. Dwork, O. Waarts, M. Yung, Perfectly secure message transmission, J. ACM 40 (1) (1993) 17-47.
6. C. Dwork, D. Peleg, N. Pippenger, E. Upfal, Fault tolerance in networks of bounded degree, SIAM J. Comput. 17 (5) (1988) 975-988.
7. S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979.
8. M.J. Fischer, N.A. Lynch, M. Merritt, Easy impossibility proofs for distributed consensus problems, Distrib. Computing 1 (1) (1986) 26-39.
9. M.K. Franklin R.N. Wright, Reliable and private communication over echo lines, Manuscript, 1997.
10. D. Powell (Guest Ed.), Special section on group communication, Comm. CACM 39 (4) (1996).
11. H. Krawczyk, in: Y.G. Desmedt (Ed.), LFSR-based hashing and authentication, Advances in Cryptology - CRYPTO '94, Lecture Notes in Computer Science, vol. 839, Springer, Berlin, 1994, 129-139.
12. H. Krawczyk, New hash functions for message authentication, in: L.C. Guillou, J.-J. Quisquater (Eds.), Advances in cryptology: EUROCRYPT '95, Lecture Notes in Computer Science, vol. 921, Springer, Berlin, 1995, pp. 301-310.
13. N.A. Lynch, Distributed Algorithms, Morgan Kaufman, 1997.
14. K. Menger, Allgemeinen kurventheorie, Fund. Math. 10 (1997) 96-115.
15. M. Pease, R. Shostak, L. Lamport, Reaching agreements in the presence of faults, J. ACM 27 (2): 228-234. (1980).
16. T. Rabin, M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, in: Proc. 21st Annu. ACM Symp. on the Theory of Computing, 1989, pp. 73-85.
17. G.J. Simmons, A survey of information authentication, in: G.J. Simmons (Ed.), Contemporary Cryptology, The Science of Information Integrity, IEEE Press, New York, 1992, pp. 441-497.
18. E. Upfal, Tolerating a linear number of faults in networks of bounded degree, Inform. and Comput. 115 (2) (1994) 312-320.
19. M. Wegman, J. Carter, New hash functions and their use in authentication and set equality, J. Comput. System Sci. 22 (1981) 265-279.