2 Hits in 3.1 sec

Dining Cryptographers with 0.924 Verifiable Collision Resolution

Christian Franck
2014 Annales UMCS Informatica  
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  ...  The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous.  ...  First, we show that with a modified SICTA collision resolution algorithm, a maximum stable throughput (MST) of 0.924 packets per round can be achieved for the dining cryptographers protocol.  ... 
doi:10.2478/umcsinfo-2014-0007 fatcat:tfyb7ccj75fs7jhbzjslcgqmaa

Footprint Scheduling for Dining-Cryptographer Networks [chapter]

Anna Krasnova, Moritz Neikes, Peter Schwabe
2017 Lecture Notes in Computer Science  
The protocol that offers the strongest anonymity guarantees, namely unconditional sender and recipient untraceability, is the Dining Cryptographer (DC) protocol proposed by Chaum in 1988.  ...  Footprint scheduling is at the same time simple, efficient and yields excellent results, in particular in very dynamic networks with a frequently changing set of participants and frequently changing activity  ...  Collision resolution. The second approach proposed by Chaum in [3] is to use a contention algorithm with discrete time slots and resolve collisions by retransmitting the messages.  ... 
doi:10.1007/978-3-662-54970-4_23 fatcat:nsbaupsqjjhavdzniryoc6e6tq