Dining Cryptographers with 0.924 Verifiable Collision Resolution

Reference : Dining Cryptographers with 0.924 Verifiable Collision Resolution


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a journal
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/23847

Title :	Dining Cryptographers with 0.924 Verifiable Collision Resolution
Language :	English
Author, co-author :	Franck, Christian []
Publication date :	2014
Journal title :	Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Publisher :	Uniwersytetu Marii Curie Sklodowskies
Volume :	14
Issue/season :	1
Pages :	49-59
Peer reviewed :	Yes (verified by ORBi^lu)
On invitation :	No
Audience :	International
ISSN :	1732-1360
e-ISSN :	2083-3628
City :	Lublin
Country :	Poland
Event name :	3rd Conference on Cryptography and Security Systems
Event date :	from 22-9-2014 to 24-9-2014
Keywords :	[en] 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.
Permalink :	http://hdl.handle.net/10993/23847
DOI :	10.2478/umcsinfo-2014-0007
Other URL :	http://arxiv.org/abs/1402.1732

There is no file associated with this reference.

All documents in ORBi^lu are protected by a user license.