Reference : Dining Cryptographers with 0.924 Verifiable Collision Resolution |
Scientific congresses, symposiums and conference proceedings : Paper published in a journal | |||
Engineering, computing & technology : Computer science | |||
http://hdl.handle.net/10993/23847 | |||
Dining Cryptographers with 0.924 Verifiable Collision Resolution | |
English | |
Franck, Christian ![]() | |
2014 | |
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica | |
Uniwersytetu Marii Curie Sklodowskies | |
14 | |
1 | |
49-59 | |
Yes (verified by ORBilu) | |
No | |
International | |
1732-1360 | |
2083-3628 | |
Lublin | |
Poland | |
3rd Conference on Cryptography and Security Systems | |
from 22-9-2014 to 24-9-2014 | |
[en] Dining Cryptographers ; Collision Resolution ; Anonymity | |
[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. | |
http://hdl.handle.net/10993/23847 | |
10.2478/umcsinfo-2014-0007 | |
http://arxiv.org/abs/1402.1732 |
There is no file associated with this reference.
All documents in ORBilu are protected by a user license.