Fast and unconditionally secure anonymous channel

DOI10.1145/2611462.2611494MaRDI QIDQ2943631zbMATH OpenOpenAlexFDO

Authors Juan Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov

Publication date 3 September 2015

Published in Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2611462.2611494

zbMATH Keywords

anonymous message transmissionByzantine agreementDC-netspseudosignatures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Communication networks in operations research (90B18) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 16478
• Dining cryptographers with 0.924 verifiable collision resolution
• Advances in Cryptology - EUROCRYPT 2004
• The Power of Anonymous Veto in Public Discussion
• Information-Theoretic Security Without an Honest Majority

Cited in

(10)

• Network-Hiding Communication and Applications to Multi-party Protocols
• Dining cryptographers with 0.924 verifiable collision resolution
• Secure Pseudonymous Channels
• The Power of Anonymous Veto in Public Discussion
• scientific article; zbMATH DE number 16478 (Why is no real title available?)
• scientific article; zbMATH DE number 1088927 (Why is no real title available?)
• scientific article; zbMATH DE number 1107712 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Footprint scheduling for dining-cryptographer networks
• Anonymous whistleblowing over authenticated channels

This page was built for publication: Fast and unconditionally secure anonymous channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943631)