%0 Journal Article
%T Dining Cryptographers with 0.924 Verifiable Collision Resolution
%A Christian Franck
%J Computer Science
%D 2014
%I arXiv
%R 10.2478/umcsinfo-2014-0007
%X 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.
%U http://arxiv.org/abs/1402.1732v3