When are three voters enough for privacy properties?

DOI10.1007/978-3-319-45741-3_13MaRDI QIDQ2165487zbMATH OpenOpenAlexFDO

Authors Myrto Arapinis, Véronique Cortier, Steve Kremer

Publication date 19 August 2022

Full work available at URL https://doi.org/10.1007/978-3-319-45741-3_13

Mathematics Subject Classification ID

Computer security (68M25) Privacy of data (68P27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Voting theory (91B12) Cryptography (94A60)

Recommendations

• One vote is enough for analysing privacy
• Vote-independence: a powerful privacy notion for voting protocols
• scientific article; zbMATH DE number 2044526
• Programming Languages and Systems
• Verifying privacy-type properties of electronic voting protocols: a taster

Cited in

(10)

• Formalizing and proving privacy properties of voting protocols using alpha-beta privacy
• Vote-independence: a powerful privacy notion for voting protocols
• Role interchange for anonymity and privacy of voting
• A formal framework for quantifying voter-controlled privacy
• Verifying privacy-type properties of electronic voting protocols: a taster
• Programming Languages and Systems
• Short Ballot Assumption and Threeballot Voting Protocol
• One vote is enough for analysing privacy
• DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
• Protecting the privacy of voters: new definitions of ballot secrecy for e-voting

This page was built for publication: When are three voters enough for privacy properties?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165487)