Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Decidability of context-explicit security protocols
Journal of Computer Security - Special issue on WITS'03
On epistemic logic with justification
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Coercion-Resistance and Receipt-Freeness in Electronic Voting
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
A (restricted) quantifier elimination for security protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
ISC'06 Proceedings of the 9th international conference on Information Security
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Specification of Electronic Voting Protocol Properties Using ADM Logic: FOO Case Study
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
An Open Framework for Remote Electronic Elections
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
A formal framework for quantifying voter-controlled privacy
Journal of Algorithms
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
A DEXPTIME-complete Dolev-Yao theory with distributive encryption
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Election verifiability in electronic voting protocols
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Towards automatic analysis of election verifiability properties
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Logic of information flow on communication channels
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Anonymity, Privacy, Onymity, and Identity: A Modal Logic Approach
Transactions on Data Privacy
Epistemic temporal logic for information flow security
Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security
Extending H1-clauses with path disequalities
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Challenges in ehealth: from enabling to enforcing privacy
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
| Hi-index | 0.00 |
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elections are naturally expressed using standard knowledge operators, and show that the associated logic is decidable (under reasonable assumptions of bounded agents and nonces).