Another twist in the dining cryptographers' protocol
Bárász, Mihály ; Ligeti, Péter ; Lója, Krisztina ; Mérai, László ; Nagy, Daniel A.
Tatra Mountains Mathematical Publications, Tome 55 (2013), / Harvested from Mathematical Institute
Link
Link

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.

Publié le : 2013-01-01
DOI : https://doi.org/10.2478/tatra.v57i0.253 
@article{253,
     title = {Another twist in the dining cryptographers' protocol},
     journal = {Tatra Mountains Mathematical Publications},
     volume = {55},
     year = {2013},
     doi = {10.2478/tatra.v57i0.253},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/253}
}

Bárász, Mihály; Ligeti, Péter; Lója, Krisztina; Mérai, László; Nagy, Daniel A. Another twist in the dining cryptographers' protocol. Tatra Mountains Mathematical Publications, Tome 55 (2013) . doi : 10.2478/tatra.v57i0.253. http://gdmltest.u-ga.fr/item/253/