Existential Assertions for Voting Protocols
Cryptography and Security
2017-02-17 v1
Abstract
In earlier work, we extend the Dolev-Yao model with assertions. We build on that work and add existential abstraction to the language, which allows us to translate common constructs used in voting protocols into proof properties. We also give an equivalence-based definition of anonymity in this model, and prove anonymity for the FOO voting protocol.
Cite
@article{arxiv.1702.05000,
title = {Existential Assertions for Voting Protocols},
author = {R. Ramanujam and Vaishnavi Sundararajan and S. P. Suresh},
journal= {arXiv preprint arXiv:1702.05000},
year = {2017}
}
Comments
Accepted for publication at the 2nd Workshop on Advances in Secure Electronic Voting Schemes, April 7, 2017. Malta