Information-theoretic security without an honest majority
arXiv:0706.2010 · doi:10.1007/978-3-540-76900-2_25
Abstract
We present six multiparty protocols with information-theoretic security that tolerate an arbitrary number of corrupt participants. All protocols assume pairwise authentic private channels and a broadcast channel (in a single case, we require a simultaneous broadcast channel). We give protocols for veto, vote, anonymous bit transmission, collision detection, notification and anonymous message transmission. Not assuming an honest majority, in most cases, a single corrupt participant can make the protocol abort. All protocols achieve functionality never obtained before without the use of either computational assumptions or of an honest majority.
15 pages, to appear in Proceedings of ASIACRYPT 2007
Cited by in corpus (14)
- Prio: Private, Robust, and Scalable Computation of Aggregate Statistics
- Self-tallying Quantum Anonymous Voting
- Anonymous Quantum Conference Key Agreement
- Anonymous quantum communication
- Information-Theoretically Secure Voting Without an Honest Majority
- Composable Security for Multipartite Entanglement Verification
- Quantum Shadows: The Dining Information Brokers
- Quantum Anonymity for Quantum Networks
- Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters
- A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem
- Anonymous Conference Key Agreement in Quantum Networks
- Anonymous communication protocol over quantum networks
- Disjoint difference families and their applications
- Benchmarking of Quantum Protocols