Secure communication in broadcast channels: The answer to franklin and wright’s question

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

Volumn 1592, Issue , 1999, Pages 446-458

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

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Network security; Perfect secrecy; Privacy; Reliability

Indexed keywords

BROADCASTING; CODES (SYMBOLS); COMPUTATION THEORY; CRYPTOGRAPHY; DATA PRIVACY; GOLD; RELIABILITY; SECURE COMMUNICATION; SIGNAL RECEIVERS;

BROADCAST CHANNELS; EFFICIENT PROTOCOLS; IN NETWORKS; PERFECT SECRECY; PRIVATE COMMUNICATION; SECURE COMPUTATION;

NETWORK SECURITY;

EID: 24944432519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_31     Document Type: Conference Paper

References (15)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non- cryptographic fault-tolerant distributed computing. In: Proc. ACM STOC, '88, pages 1-10, ACM Press, 1988.
2. M. Burmester, Y. Desmedt, and G. Kabatianski. Trust and Security: A New Look at the Byzantine Generals Problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 38, pages 75-83, American Mathematical Society, 1998.
3. M. Burmester, Y. Desmedt, and Y. Wang. Using approximation hardness to achieve dependable computation. In: Proc. of the Second International Conference on Randomization and Approximation Techniques in Computer Science, LNCS 1518, pages 172-186, Springer Verlag, 1998.
4. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditional secure proto- cols. In: Proc. ACM STOC, '88, pages 11-19, ACM Press, 1988.
5. B. den Boer. A simple and key-economical unconditional authentication scheme. Journal of Computer Security, 2:65-71, 1993.
6. D. Dolev. The Byzantine generals strike again. J. of Algorithms, 3:14-30, 1982.
7. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmis- sion. J. of the ACM, 40(1):17-47, 1993.
8. M. Franklin and N. Wright. Secure communication in minimal connectivity models. In: Advances in Cryptology, Proc. of Euro Crypt '98, LNCS 1403, pages 346-360, Springer Verlag, 1998.
9. M. Franklin and M. Yung. Secure hypergraphs: privacy from partial broadcast. In: Proc. ACM STOC, '95, pages 36-44, ACM Press, 1995.
10. E. Gilbert, F. MacWilliams, and N. Sloane. Codes which detect deception. The BELL System Technical Journal, 53(3):405-424, 1974.
11. O. Goldreich, S. Goldwasser, and N. Linial. Fault-tolerant computation in the full information model. SIAM J. Comput. 27(2):506-544, 1998.
12. V. Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University, Cambridge, MA, 1984.
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. G. J. Simmons. A survey of information authentication. In: Contemporay Cryptology, The Science of Information Integrity, pages 379-419. IEEE Press, 1992.