Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/efficient-reliable-communication-over-partially-authenticated-networks-kRhxS0108Y
References (33)
-
D. Dolev (1981)
The Byzantine Generals Strike AgainJ. Algorithms, 3
-
M. Wegman, L. Carter (1981)
New Hash Functions and Their Use in Authentication and Set EqualityJ. Comput. Syst. Sci., 22
-
(1994)
LFSR-based hashing and authentication. In: DesmedtYG (ed) Advances in Cryptology – CRYPTO ’94 -
(1979)
S. Even. Graph Algorithms. Computer Science press -
(1992)
A survey of information authentication The Science of Information Integrity -
E. Upfal (1992)
Tolerating linear number of faults in networks of bounded degree -
(1992)
A survey of information authentication Contemporary Cryptology, The Science oflnformation Integrity -
M. Bläser, A. Jakoby, M. Liskiewicz, B. Manthey (2002)
Private Computation: k-Connected versus 1-Connected NetworksJournal of Cryptology, 19
-
C. Dwork, D. Peleg, N. Pippenger, E. Upfal (1986)
Fault tolerance in networks of bounded degreeSIAM J. Comput., 17
-
Oded Goldreich, S. Goldwasser, N. Linial (1991)
Fault-tolerant computation in the full information model[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
-
David Bader, Guojing Cong (2018)
Graph AlgorithmsEffective Theories in Programming Practice
-
K. Srinathan, V. Vaikuntanathan, C. Rangan (2003)
Brief announcement: efficient perfectly secure communication over synchronous networks -
T. Rabin, M. Ben-Or (1989)
Verifiable secret sharing and multiparty protocols with honest majority -
G. Simmons (1988)
A survey of information authenticationProc. IEEE, 76
-
H. Krawczyk (1994)
LFSR-based Hashing and Authentication -
(1992)
A survey of information authentication. In: Simmons GJ (ed) Contemporary Cryptology, The Science of Information Integrity, pp 441–497 -
Hasan Sayeed, H. Abu-Amara (1996)
Efficient Perfectly Secure Message Transmission in Synchronous NetworksInf. Comput., 126
-
Amos Beimel, M. Franklin (1997)
Reliable Communication over Partially Authenticated NetworksTheor. Comput. Sci., 220
-
Ashwin Machanavajjhala, P. Goundan, K. Srinathan, C. Rangan (2002)
On perfectly secure communication over arbitrary networks -
Yongge Wang, Y. Desmedt (1999)
Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question -
D. Dolev, C. Dwork, Orli Waarts, M. Yung (1990)
Perfectly secure message transmissionProceedings [1990] 31st Annual Symposium on Foundations of Computer Science
-
M. Fischer, N. Lynch, Michael Merritt (1985)
Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1
-
N. Lynch (1994)
Distributed Algorithms, 857
-
Hasan Sayeed, H. Abu-Amara (1995)
Perfectly secure message transmission in asynchronous networksProceedings.Seventh IEEE Symposium on Parallel and Distributed Processing
-
H. Krawczyk (1995)
New Hash Functions For Message Authentication -
L. Carter, M. Wegman (1979)
Universal Classes of Hash FunctionsJ. Comput. Syst. Sci., 18
-
(1997)
Lynch.Distributed Algorithms -
(1995)
( eds ) Advances in Cryptology – EUROCRYPT ’ 95 -
M. Franklin, M. Yung (1995)
Secure hypergraphs: privacy from partial broadcastSIAM J. Discret. Math., 18
-
(1994)
Tolerating a linear number of faults in networ ks of bounded degree. Information and Computation -
(1996)
Efficient perfectly secur e message transmission in synchronous networks. Information and Computation -
M. Franklin, R. Wright (2000)
Secure Communication in Minimal Connectivity ModelsJournal of Cryptology, 13
-
(2001)
Secure communication in multi-cast channels: The answer to Franklin and Wright’s
- Publisher
- Springer Journals
- Copyright
- Copyright © 2005 by Springer-Verlag Berlin/Heidelberg
- Subject
- Computer Science; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation; Computer Communication Networks
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-004-0119-y
- Publisher site
- See Article on Publisher Site
Abstract
Reliable communication between processors in a network is a basic requirement for executing any protocol. Dolev [7] and Dolev et al. [8] showed that reliable communication is possible if and only if the communication network is sufficiently connected. Beimel and Franklin [1] showed that the connectivity requirement can be relaxed if some pairs of processors share authentication keys. That is, costly communication channels can be replaced by authentication keys.
Journal
Distributed Computing – Springer Journals
Published: Jan 1, 2004