Information-Theoretic Security Without an Honest Majority
Authors:
- 13 June 2007
- book chapter
- Published by Springer Nature
- p. 410-426
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Simultaneous broadcast revisited2005
- Secret Sharing Schemes with Detection of Cheaters for a General Access StructureDesigns, Codes and Cryptography, 2002
- Multi-Authority Secret-Ballot Elections with Linear Work1996
- Receipt-Free Mix-Type Voting Scheme1995
- Verifiable secret sharing and multiparty protocols with honest majority1989
- Multiparty unconditionally secure protocols1988
- The dining cryptographers problem: Unconditional sender and recipient untraceabilityJournal of Cryptology, 1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988
- Verifiable secret sharing and achieving simultaneity in the presence of faults1985
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981