Formalising Receipt-Freeness

DOI10.1007/11836810_34MaRDI QIDQ3506899zbMATH OpenOpenAlexFDO

Authors Hugo Jonker, Erik de Vink

Publication date 17 June 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11836810_34

zbMATH Keywords

eGovernmentformal methodsonline voting schemesreceipt-freeness

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A critique of game-based definitions of receipt-freeness for voting
• Efficent receipt-free voting based on homomorphic encryption
• Receipt-free secret-ballot elections (extended abstract)
• scientific article; zbMATH DE number 1149900
• scientific article; zbMATH DE number 1676659

Cited in

(11)

• Formalizing and proving privacy properties of voting protocols using alpha-beta privacy
• A critique of game-based definitions of receipt-freeness for voting
• Receipt-free secret-ballot elections (extended abstract)
• Efficent receipt-free voting based on homomorphic encryption
• Incoercible multi-party computation and universally composable receipt-free voting
• Privacy and verifiability in voting systems: methods, developments and trends
• scientific article; zbMATH DE number 1950626 (Why is no real title available?)
• A formal framework for modelling coercion resistance and receipt freeness
• Information Security and Cryptology - ICISC 2003
• Traceable receipt-free encryption
• To know or not to know: Epistemic approaches to security protocol verification

This page was built for publication: Formalising Receipt-Freeness

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