Dining Cryptographers with 0.924 Verifiable Collision Resolution

DOI10.2478/UMCSINFO-2014-0007zbMath1391.94750arXiv1402.1732OpenAlexW2081497391MaRDI QIDQ2960384

Christian Franck

Publication date: 9 February 2017

Full work available at URL: https://arxiv.org/abs/1402.1732

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Beating the Birthday Paradox in Dining Cryptographer Networks

Cites Work

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Unnamed Item
• Unnamed Item

This page was built for publication: Dining Cryptographers with 0.924 Verifiable Collision Resolution