Beating the Birthday Paradox in Dining Cryptographer Networks

DOI10.1007/978-3-319-16295-9_10zbMath1378.94044OpenAlexW582256444MaRDI QIDQ2946474

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• 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
• The Knowledge Complexity of Interactive Proof Systems
• Advances in Cryptology - EUROCRYPT 2004

This page was built for publication: Beating the Birthday Paradox in Dining Cryptographer Networks