A formal framework for modelling coercion resistance and receipt freeness

DOI10.1007/978-3-642-32759-9_19MaRDI QIDQ4647845zbMATH OpenOpenAlexDBLPWikidataFDO

Authors James Heather, S. A. Schneider

Publication date 8 November 2012

Published in FM 2012: Formal Methods (Search for Journal in Brave)

Full work available at URL http://epubs.surrey.ac.uk/726040/2/SRI_deposit_agreement.pdf

zbMATH Keywords

CSPcoercion-resistancereceipt-freenesssecure voting

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Formalising Receipt-Freeness
• A critique of game-based definitions of receipt-freeness for voting
• Coercion-resistant electronic elections
• A formal framework for quantifying voter-controlled privacy
• Relations between privacy, verifiability, accountability and coercion-resistance in voting protocols

Cited in

(1)

• Incoercible multi-party computation and universally composable receipt-free voting

This page was built for publication: A formal framework for modelling coercion resistance and receipt freeness

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