No full text
Paper published in a journal (Scientific congresses, symposiums and conference proceedings)
Dining Cryptographers with 0.924 Verifiable Collision Resolution
Franck, Christian
2014In Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica, 14 (1), p. 49-59
Peer reviewed
 

Files


Full Text
No document available.

Send to



Details



Keywords :
Dining Cryptographers; Collision Resolution; Anonymity
Abstract :
[en] 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.
Disciplines :
Computer science
Author, co-author :
External co-authors :
no
Language :
English
Title :
Dining Cryptographers with 0.924 Verifiable Collision Resolution
Publication date :
2014
Event name :
3rd Conference on Cryptography and Security Systems
Event date :
from 22-9-2014 to 24-9-2014
Audience :
International
Journal title :
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
ISSN :
2083-3628
Publisher :
Uniwersytetu Marii Curie Sklodowskies, Lublin, Poland
Volume :
14
Issue :
1
Pages :
49-59
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 26 January 2016

Statistics


Number of views
82 (10 by Unilu)
Number of downloads
0 (0 by Unilu)

OpenCitations
 
2

Bibliography


Similar publications



Contact ORBilu