HackerPapers

arXiv:1702.05000cs.CR

Existential Assertions for Voting Protocols

R. Ramanujam, Vaishnavi Sundararajan, S. P. Suresh

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Accepted for publication at the 2nd Workshop on Advances in Secure Electronic Voting Schemes, April 7, 2017. Malta
Journal reference
DOI
Subjects
cs.CRCryptography and Security

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Feb 2017 to Feb 2017.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. If you were asked to solve the 'fake news' problem, how would you solve it? 1 comment

    • Cryptography - centralized/decentralized certification of special <article news-UUID=<some long hash> > elements. User can install cert authorities like [NYT, RT, Reuters] or whatever their preference, who serve as independent consensus auditors of sorts. To prevent leakage of…

      pizzaView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.