Secure communication in minimal connectivity models

Journal of Cryptology

Volumn 13, Issue 1, 2000, Pages 9-30

  Franklin, Matthew ^a   Wright, Rebecca N ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Multicast; Network security; Privacy; Reliability; Secure multiparty computation

Indexed keywords

EID: 0003640244     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459910002     Document Type: Article

References (20)

1. [ABLP] N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, On the complexity of radio communication, ACM STOC, pp. 274-285 (1989).
2. [Bea] D. Beaver, Multiparty protocols tolerating half faulty processors, Proc. Crypto '89, pp. 560-572 (1989).
3. [BF] A. Beimel and M. Franklin, Reliable communication over partially authenticated networks, Theoret. Comput. Sci., 220(1):185-210 (1999).
4. [BCG] M. Ben-Or, R. Canetti, and O. Goldreich, Asynchronous secure computation, Proc. ACM STOC, pp. 52-61 (1993).
5. [BGW] M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computing, Proc. ACM STOC, pp. 1-10 (1988).
6. [BBR] C. Bennett, G. Brassard, and M. Robert, Privacy amplification by public discussion, SIAM J. Cotnput., 17(2):210-229(1988).
7. [BT] G. Bracha and S. Toueg, Asynchronous consensus and broadcast protocols, J. Assoc. Comput. Mach., 32(4):824-840 (1985).
8. [BDK] M. Burmester, Y. Desmedt, and G. Kabatianski, Trust and security: a new look at the Byzantine generals problem, in Network Threats, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 38, pp. 75-83, American Mathematical Society, Providence, RI (1997).
9. [CCD] D. Chaum, C. Crepeau, and I. Damgard, Multiparty unconditional secure protocols, Proc. ACM STOC, pp. 11-19(1988).
10. [Ch] D. Chcriton and W. Zwaenepoel, Distributed process group in the V kernel, ACM Trans. Comput. Systems, 3:77-107 (1985).
11. [Dol] D. Dolev, The Byzantine generals strike again, J. Algorithms, 3:14-30 (1982).
12. [DDWY] D. Dolev, C. Dwork, O. Waarts, and M. Yung, Perfectly secure message transmission, J. Assoc. Comput. Mach., 40(l):17-t7 (1993).
13. [FY] M. Franklin and M. Yung, Secure hypergraphs: privacy from partial broadcast, SIAM J. Discrete Math., to appear.
14. [GGL] O. Goldreich, S. Goldwasser, and N. Linial, Fault-tolerant computation in the full information model, Proc. lEEESymp. FOCS, pp. 447-157 (1991).
15. [PSL] M. Pease, R. Shostak, and L. Lamport, Reaching agreement in the presence of faults, J. Assoc. Comput. Mach., 27(2):228-234 (1980).
16. [PG] F. M. Pittelli and H. Garcia-Molina, Reliable scheduling in a TMR database system, ACM Trans. Comput. Systems, 7(1):25-60 (1989)
17. [Rab] T. Rabin, Robust sharing of secrets when the dealer is honest or faulty, J. Assoc. Comput. Mach., 41(6):1089-1109 (1994).
18. [RB] T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proc. ACM STOC, pp. 73-85 (1989).
19. [SA] H. Sayeed and H. Abu-Amara, Efficient perfectly secure message transmission in synchronous networks, Inform, and Comput., 126(1):53-61 (1996).
20. [WDJ Y. Wang and Y. Desmedt, Secure communication in broadcast channels: the answer to Franklin and Wright's question, Proc. Eurocrypt '99, pp. 446-458 (1999).