Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster

DOI10.1007/978-3-642-12980-3_18zbMath1284.68243OpenAlexW2142976113MaRDI QIDQ3569110

Steve Kremer, Stéphanie Delaune, Mark D. Ryan

Publication date: 17 June 2010

Published in: Towards Trustworthy Elections (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12980-3_18

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (13)

Trace Equivalence and Epistemic Logic to Express Security Properties ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ POR for security protocol equivalences. Beyond action-determinism ⋮ Efficiently deciding equivalence for standard primitives and phases ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Decidability of equivalence of symbolic derivations ⋮ Computing knowledge in security protocols under convergent equational theories ⋮ Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols ⋮ On Communication Models When Verifying Equivalence Properties ⋮ On compositional reasoning about anonymity and privacy in epistemic logic ⋮ Computing Knowledge in Security Protocols under Convergent Equational Theories ⋮ YAPA: A Generic Tool for Computing Intruder Knowledge ⋮ Deciding knowledge in security protocols under some e-voting theories

This page was built for publication: Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster