Beating the birthday paradox in dining cryptographer networks

DOI10.1007/978-3-319-16295-9_10MaRDI QIDQ2946474zbMATH OpenOpenAlexFDO

Authors Pablo García, Jeroen van de Graaf, Alejandro Hevia, Alfredo Viola

Publication date 17 September 2015

Published in Progress in Cryptology - LATINCRYPT 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-16295-9_10

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Recommendations

• Dining cryptographers with 0.924 verifiable collision resolution
• Advances in Cryptology - EUROCRYPT 2004
• Another twist in the dining cryptographers' protocol
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• scientific article; zbMATH DE number 16478

Cites work

• scientific article; zbMATH DE number 3727274 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1304079 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Analytic combinatorics
• Anonymous one-time broadcast using non-interactive dining cryptographer nets with applications to voting
• Dining cryptographers with 0.924 verifiable collision resolution
• SPHF-friendly non-interactive commitments
• The Knowledge Complexity of Interactive Proof Systems
• The dining cryptographers problem: Unconditional sender and recipient untraceability

This page was built for publication: Beating the birthday paradox in dining cryptographer networks

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