Secure communication in minimal connectivity models

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

Volumn 1403, Issue , 1998, Pages 346-360

  Franklin, Matthew ^a   Wright, Rebecca N ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; INFORMATION THEORY; SECURE COMMUNICATION;

CHANNEL MODEL; CONNECTIVITY MODEL; IN NETWORKS; NATURAL MODELS; NETWORK CONNECTIVITY; PERFECT SECURITIES; PROBABILISTIC SECURITIES; SECURE MULTI-PARTY COMPUTATION;

NETWORK SECURITY;

EID: 84957653101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054138     Document Type: Conference Paper

References (17)

1. [ABLP89] N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, "On the complexity of radio communication," ACM STOC, 1989, 274-285.
2. [Bea89] D. Beaver, "Multiparty protocols tolerating half faulty processors," Proc. Crypto ’89, 560-572.
3. [BF97] A. Beimel and M. Franklin, "Reliable communication over partially authenticated networks," Proc. Workshop on Distributed Algorithms (WDAG), Springer-Verlag LNCS 1320, 1997, 245-259.
4. [BCG93] M. Ben-Or, R. Canetti, and O. Goldreich, "Asynchronous secure computation," ACM STOC, 1993, 52-61.
5. [BGW88] M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computing," ACM STOC, 1988, 1-10.
6. [BT85] G. Bracha and S. Toueg, "Asynchronous consensus and broadcast protocols", JACM 32(4): 824-840 (1985).
7. [BDK97] M. Burmester, Y. Desmedt, and G. Kabatianski, "Trust and Security: A New Look at the Byzantine Generals Problem", Network Threats, DI-MACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, (to appear).
8. [CCD88] D. Chaum, C. Crepeau, said I. Damgard, "Multiparty unconditional secure protocols," ACM STOC, 1988, 11-19.
9. [Ch85] D. Cheriton and W. Zwaenepoel, "Distributed process group in the V kernel" ACM Trans, on Computer Systems 3, (1985), 77-107.
10. [Dol82] D. Dolev, "The Byzantine Generals strike again," J. Algorithms 3:14-30, 1982.
11. [DDWY93] D. Dolev, C. Dwork, O. Waarts, and M. Yung, "Perfectly secure message transmission," JACM 40(1): 17-47, 1993.
12. [FY95] M. Franklin and M. Yung, "Secure hypergraphs: privacy from partied broadcast," ACM STOC, 1995, 36-44.
13. [GGL91] O. Goldreich, S. Goldwasser, and N. Linial, "Fault-tolerant computation in the full information model," IEEE FOCS, 1991, 447-457.
14. [PSL80] M. Pease, R. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults", JACM 27(2): 228-234, 1980.
15. [PG89] F. M. Pittelli and H. Garcia-Molina, "Reliable Scheduling in a TMR Database System", ACM Transactions on Computer Systems 7(1): 25-60, 1989.
16. [Rab94] T. Rabin, "Robust sharing of secrets when the dealer is honest or faulty," JACM 41(6):1089-1109, 1994.
17. [RB89] T. Rabin and M. Ben-Or, "Verifiable secret sharing and multiparty protocols with honest majority," ACM STOC, 1989, 73-85.