How to fake zero-knowledge proofs, again

How to fake zero-knowledge proofs, again. Véronique Cortier, Pierrick Gaudry, and Quentin Yang. In Fifth International Joint Conference on Electronic Voting (E-Vote-ID 2020), Bregenz / virtual, Austria, 2020.

Download

[PDF]

Abstract

In 2012, Bernhard et al. showed that the Fiat-Shamir heuristic must be used with great care in zero-knowledge proofs. We explain how, in the Belenios voting system, while not using the weak version of Fiat-Shamir, there is still a gap that allows to fake a zero-knowledge proof in certain circumstances. Therefore an attacker who corrupts the voting server and the decryption trustees could break verifiability.

BibTeX

@inproceedings{EVoteID20-Belenios,
  TITLE = {{How to fake zero-knowledge proofs, again}},
  AUTHOR = {Cortier, V{\'e}ronique and Gaudry, Pierrick and Yang, Quentin},
  BOOKTITLE = {{Fifth International Joint Conference on Electronic Voting (E-Vote-ID 2020)}},
  ADDRESS = {Bregenz / virtual, Austria},
  YEAR = {2020},
  abstract = {In 2012, Bernhard et al. showed that the Fiat-Shamir heuristic must be used with great care in zero-knowledge proofs. We explain how, in the Belenios voting system, while not using the weak version of Fiat-Shamir, there is still a gap that allows to fake a zero-knowledge proof in certain circumstances. Therefore an attacker who corrupts the voting server and the decryption trustees could break verifiability. },
}