Abstract
Problems of secure communication and computation have been studied extensively in network models. In this work, we ask what is possible in the information-theoretic setting when the adversary is very strong (Byzantine) and the network connectivity is very low (minimum needed for crash-tolerance). For some natural models, our results imply a sizable gap between the connectivity required for perfect security and for probabilistic security. Our results also have implications to the commonly studied simple channel model and to general secure multiparty computation.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, “On the complexity of radio communication,” ACM STOC, 1989, 274–285.
D. Beaver, “Multiparty protocols tolerating half faulty processors,” Proc. Crypto '89, 560–572.
A. Beimel and M. Franklin, “Reliable communication over partially authenticated networks,” Proc. Workshop on Distributed Algorithms (WDAG), Springer-Verlag LNCS 1320, 1997, 245–259.
M. Ben-Or, R. Canetti, and O. Goldreich, “Asynchronous secure computation,” ACM STOC, 1993, 52–61.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computing,” ACM STOC, 1988, 1–10.
G. Bracha and S. Toueg, “Asynchronous consensus and broadcast protocols”, JACM 32(4): 824–840 (1985).
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).
D. Chaum, C. Crepeau, and I. Damgard, “Multiparty unconditional secure protocols,” ACM STOC, 1988, 11–19.
D. Cheriton and W. Zwaenepoel, “Distributed process group in the V kernel” ACM Trans. on Computer Systems 3, (1985), 77–107.
D. Dolev, “The Byzantine Generals strike again,” J. Algorithms 3:14–30, 1982.
D. Dolev, C. Dwork, O. Waarts, and M. Yung, “Perfectly secure message transmission,” JACM 40(1): 17–47, 1993.
M. Franklin and M. Yung, “Secure hypergraphs: privacy from partial broadcast,” ACM STOC, 1995, 36–44.
O. Goldreich, S. Goldwasser, and N. Linial, “Fault-tolerant computation in the full information model,” IEEE FOCS, 1991, 447–457.
M. Pease, R. Shostak, and L. Lamport, “Reaching Agreement in the Presence of Faults”, JACM 27(2): 228–234, 1980.
F. M. Pittelli and H. Garcia-Molina, “Reliable Scheduling in a TMR Database System”, ACM Transactions on Computer Systems 7(1): 25–60, 1989.
T. Rabin, “Robust sharing of secrets when the dealer is honest or faulty,” JACM 41(6):1089–1109, 1994.
T. Rabin and M. Ben-Or, “Verifiable secret sharing and multiparty protocols with honest majority,” ACM STOC, 1989, 73–85.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franklin, M., Wright, R.N. (1998). Secure communication in minimal connectivity models. In: Nyberg, K. (eds) Advances in Cryptology — EUROCRYPT'98. EUROCRYPT 1998. Lecture Notes in Computer Science, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054138
Download citation
DOI: https://doi.org/10.1007/BFb0054138
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64518-4
Online ISBN: 978-3-540-69795-4
eBook Packages: Springer Book Archive