Modal and temporal logics for processes
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new logic for electronic commerce protocols
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
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
Receipt-Free Electronic Voting Schemes for Large Scale Elections
Proceedings of the 5th International Workshop on Security Protocols
Verifiable secret-ballot elections
Verifiable secret-ballot elections
Coercion-Resistance and Receipt-Freeness in Electronic Voting
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Data Anonymity in the FOO Voting Scheme
Electronic Notes in Theoretical Computer Science (ENTCS)
Epistemic Verification of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
Knowledge-based modelling of voting protocols
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Efficient receipt-free voting based on homomorphic encryption
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A framework for automatically checking anonymity with µCRL
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Accountability: definition and relationship to verifiability
Proceedings of the 17th ACM conference on Computer and communications security
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
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
| Hi-index | 0.00 |
It is a well known fact that only formal methods can provide a proof that a given system meets its requirements. For critical systems (e.g. nuclear reactors, aircraft), the use of these methods becomes mandatory. Electronic voting is also one of these critical systems since the stakes are important: democracy. In this context, we propose in this paper, the use of the ADM logic in order to specify security properties (fairness, eligibility, individual verifiability and universal verifiability) of electronic voting protocols. These properties are first specified in a general form, and then adapted to the FOO protocol as a case study. Our goal is to verify these properties against a trace-based model. The choice of the ADM logic is motivated by the fact that it offers several features that are useful for trace analysis. Moreover, the logic is endowed with a tableau-based proof system that leads to a local model checking which enables an efficient implementation.