Information-Theoretic Security Without an Honest Majority

DOI10.1007/978-3-540-76900-2_25zbMath1153.94356OpenAlexW1794864632MaRDI QIDQ3498390

Anne Broadbent, Alain Tapp

Publication date: 15 May 2008

Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_25

zbMATH Keywords

collision detectioninformation-theoretic securitydining cryptographersanonymous message transmissionelection protocolsMultiparty computation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

Reconciling non-malleability with homomorphic encryption ⋮ Quantum anonymous ranking and selection with verifiability ⋮ Anonymous quantum conference key agreement using the W state ⋮ Quantum private communication with an anonymous sender ⋮ Disjoint difference families and their applications ⋮ Algebraic manipulation detection codes ⋮ Econometrics with Privacy Preservation ⋮ Towards Robust Computation on Encrypted Data ⋮ Anonymous Quantum Communication ⋮ Quantum anonymous notification for network-based applications ⋮ Practical anonymous entanglement with noisy measurement ⋮ Anonymous communication protocol over quantum networks ⋮ Multiparty anonymous quantum communication without multipartite entanglement

Cites Work

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Secret sharing schemes with detection of cheaters for a general access structure
• Algebraic manipulation detection codes
• Multi-Authority Secret-Ballot Elections with Linear Work
• Simultaneous broadcast revisited
• Unnamed Item

This page was built for publication: Information-Theoretic Security Without an Honest Majority