Dining Cryptographers with 0.924 Verifiable Collision Resolution
This addresses the issue of communication disruption in anonymous multiple access channels, offering a verifiable solution for secure and efficient protocols.
The paper tackles the problem of malicious participants disrupting communication in the dining cryptographers protocol by deliberately creating collisions, proposing a computationally secure protocol with collision resolution that achieves a maximum stable throughput of 0.924 messages per round and enables easy detection of disruptors.
The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous. A problem is that a malicious participant can disrupt communication by deliberately creating collisions. We propose a computationally secure dining cryptographers protocol with collision resolution that achieves a maximum stable throughput of 0.924 messages per round and which allows to easily detect disruptors.