Advances in Cryptology - EUROCRYPT 2004
From MaRDI portal
Publication:5307269
DOI10.1007/B97182zbMath1122.94420OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307269
Publication date: 25 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97182
Related Items (11)
Topology-hiding computation beyond semi-honest adversaries ⋮ Secure Multi-party Shuffling ⋮ Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol ⋮ Beating the Birthday Paradox in Dining Cryptographer Networks ⋮ Dining Cryptographers with 0.924 Verifiable Collision Resolution ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL ⋮ A one-round secure message broadcasting protocol through a key sharing tree ⋮ \(k\)-anonymous data collection ⋮ The Power of Anonymous Veto in Public Discussion ⋮ Network-Hiding Communication and Applications to Multi-party Protocols
This page was built for publication: Advances in Cryptology - EUROCRYPT 2004