ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL
Open Access
|Feb 2014Abstract
In this paper, we explore the Dining Cryptographers’ protocol over a cyclic group with a one-way homomorphic image, using a boardroom voting protocol as an illustration of its desirable security properties. In particular, we address the problem of anonymous disruption, which is one of the main disadvantages of DC over more usual groups like binary vectors.
Language: English
Page range: 85 - 99
Published on: Feb 18, 2014
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2014 Mihály Bárász, Péter Ligeti, Krisztina Lója, László Mérai, Dániel A. Nagy, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons License.