Dining Cryptographers with 0.924 Verifiable Collision Resolution

Christian Franck

Abstract


The dining cryptographers protocol implements a multiple access channel in whichsenders and recipients are anonymous. A problem is that a malicious participant can disrupt commu-nication by deliberately creating collisions. We propose a computationally secure dining cryptogra-phers protocol with collision resolution that achieves a maximum stable throughput of 0.924 messagesper round and which allows to easily detect disruptors.

Full Text:

PDF


DOI: http://dx.doi.org/10.2478/umcsinfo-2014-0007
Data publikacji: 2014-01-01 00:00:00
Data złożenia artykułu: 2016-04-28 09:10:05


Statistics


Total abstract view - 296
Downloads (from 2020-06-17) - PDF - 0

Indicators



Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.