Efficient reliable communication over partially authenticated networks
- 13 July 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 233-242
- https://doi.org/10.1145/872035.872070
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Perfectly Secure Message Transmission RevisitedPublished by Springer Nature ,2002
- Reliable communication over partially authenticated networksTheoretical Computer Science, 1999
- Efficient Perfectly Secure Message Transmission in Synchronous NetworksInformation and Computation, 1996
- Secure hypergraphsPublished by Association for Computing Machinery (ACM) ,1995
- Tolerating a Linear Number of Faults in Networks of Bounded DegreeInformation and Computation, 1994
- Perfectly secure message transmissionJournal of the ACM, 1993
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Fault Tolerance in Networks of Bounded DegreeSIAM Journal on Computing, 1988
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- The Byzantine generals strike againJournal of Algorithms, 1982