<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></abstract>

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.

ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL

Department of Computeralgebra and ELTECRYPT

Tatra Mountains Mathematical Publications

{"article-title":"ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS\u2019 PROTOCOL"}

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...

ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL

Data publikacji: 18 lut 2014

Zakres stron: 85 - 99

DOI: https://doi.org/10.2478/tmmp-2013-0037

This content is open access.