When Are Three Voters Enough for Privacy Properties?
Authors:
- 15 September 2016
- book chapter
- Published by Springer Nature
- p. 241-260
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Practical Everlasting Privacy2013
- Proving More Observational Equivalences with ProVerifLecture Notes in Computer Science, 2013
- Reduction of Equational Theories for Verification of Trace Equivalence: Re-encryption, Associativity and Commutativity2012
- Defining Privacy for Weighted Votes, Single and Multi-voter Coercion2012
- Automated verification of selected equivalences for security protocolsThe Journal of Logic and Algebraic Programming, 2008
- Analysis of an Electronic Voting Protocol in the Applied Pi Calculus2005
- Security properties: two agents are sufficientScience of Computer Programming, 2004
- Mobile values, new names, and secure communicationACM SIGPLAN Notices, 2001
- Receipt-free electronic voting schemes for large scale elections1998
- A practical secret voting scheme for large scale elections1993