Beating the birthday paradox in dining cryptographer networks

DOI10.1007/978-3-319-16295-9_10zbMATH Open1378.94044OpenAlexW582256444MaRDI QIDQ2946474FDOQ2946474

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Cites Work

• Title not available (Why is that?)
• Analytic combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• The Knowledge Complexity of Interactive Proof Systems
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• SPHF-friendly non-interactive commitments
• Dining cryptographers with 0.924 verifiable collision resolution
• Anonymous one-time broadcast using non-interactive dining cryptographer nets with applications to voting

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)