Perfectly Secure Message Transmission Revisited
- 29 April 2002
- book chapter
- Published by Springer Nature
- p. 502-517
- https://doi.org/10.1007/3-540-46035-7_33
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Secure Communication in Multicast Channels: The Answer to Franklin and Wright's QuestionJournal of Cryptology, 2001
- Secure Communication in Minimal Connectivity ModelsJournal of Cryptology, 2000
- Fault-tolerant Computation in the Full Information ModelSIAM Journal on Computing, 1998
- Secure hypergraphsPublished by Association for Computing Machinery (ACM) ,1995
- Robust sharing of secrets when the dealer is honest or cheatingJournal of the ACM, 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
- The Byzantine generals strike againJournal of Algorithms, 1982
- On sharing secrets and Reed-Solomon codesCommunications of the ACM, 1981
- Codes Which Detect DeceptionBell System Technical Journal, 1974