Perfectly secure message transmission revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2332, Issue , 2002, Pages 502-517

  Desmedt, Yvo ^a,b   Wang, Yongge ^c  

^a Florida State University   (United States)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c Karthika Technologies Inc

Author keywords

Network connectivity; Network security; Privacy; Reliability

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; DATA PRIVACY; MULTICASTING; RELIABILITY; SECURE COMMUNICATION;

ACTIVE ADVERSARY; IN NETWORKS; MULTICAST CHANNELS; NETWORK CHANNEL; NETWORK CONNECTIVITY; PERFECTLY SECURE MESSAGE TRANSMISSIONS; SECURE COMPUTATION; SECURE MESSAGE TRANSMISSION;

NETWORK SECURITY;

EID: 84888077711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_33     Document Type: Conference Paper

References (15)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computing. In: Proc. ACM STOC, ’88, pages 1–10, ACM Press, 1988.
2. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditional secure protocols. In: Proc. ACM STOC ’88, pages 11–19, ACM Press, 1988.
3. D. Dolev. The Byzantine generals strike again. J. of Algorithms, 3:14–30, 1982.
4. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. J. of the ACM, 40(1):17–47, 1993.
5. L.R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
6. M. Franklin and R.Wright. Secure communication in minimal connectivity models. Journal of Cryptology, 13(1):9–30, 2000.
7. M. Franklin and M. Yung. Secure hypergraphs: privacy from partial broadcast. In: Proc. ACM STOC ’95, pages 36–44, ACM Press, 1995.
8. E. Gilbert, F. MacWilliams, and N. Sloane. Codes which detect deception. The BELL System Technical Journal, 53(3):405–424, 1974.
9. O. Goldreich, S. Goldwasser, and N. Linial. Fault-tolerant computation in the full information model. SIAM J. Comput. 27(2):506–544, 1998.
10. V. Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University, Cambridge, MA, 1984.
11. F. J. MacWilliams and N. J. A. Sloane. The theoryof error-correcting codes. North-Holland Publishing Company, 1978.
12. R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9):583–584, September 1981.
13. T. Rabin. Robust sharing of secrets when the dealer is honest or faulty. J. of the ACM, 41(6):1089–1109, 1994.
14. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. ACM STOC ’89, pages 73–85, ACM Press, 1989.
15. Y. Wang and Y. Desmedt. Secure communication in multicast channels: the answer to Franklin and Wright’s question. J. of Cryptology, 14(2):121–135, 2001.