Verifying privacy-type properties of electronic voting protocols
By Stéphanie Delaune, Steve Kremer, Mark Dermot Ryan. Journal of computing and security, 2009
381 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/abb1a2666cbac9723f1e93bd59e33cd56fbb5e40
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Isabel Wagner
- Bruno Blanchet
- David Eckhoff
- Cas J. F. Cremers
- Luca Viganò
- Cjf Cas Cremers
- Cédric Fournet
In Computer Networks and Communications
- Isabel Wagner
- Bruno Blanchet
- David Eckhoff
- Cas J. F. Cremers
- Luca Viganò
- Cjf Cas Cremers
- Cédric Fournet
Citations in the corpus
- Technical Privacy Metrics (2015, methodology): “ulus such as the applied π-calculus.2 Observational equivalence is fulfilled if the observable outputs from protocol runs in two situations are equivalent. This has been used, e.g., in voting privacy [36], mobile telephony [12] and webs of trust [16]. 5.5 Adversary’s Success Probability Metrics base”
- Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif (2016, background): “Some protocols, such as e-voting protocols (Delaune et al., 2009), require more complex and specific security properties, which we will not discuss.”