Evaluating security of voting schemes in the universal composability framework

DOI10.1007/978-3-540-24852-1_4MaRDI QIDQ4680970zbMATH OpenOpenAlexFDO

Authors Jens Groth

Publication date 13 June 2005

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

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

zbMATH Keywords

homomorphic threshold encryptionuniversal composabilityVoting

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On some incompatible properties of voting schemes
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• Efficent receipt-free voting based on homomorphic encryption
• Unconditionally secure electronic voting
• Secure voting using partially compatible homomorphisms

Cited in

(12)

• Memory lower bounds of reductions revisited
• Zero-knowledge proofs for committed symmetric Boolean functions
• Short paper: ballot secrecy for liquid democracy
• A lattice-based group signature scheme with message-dependent opening
• Policy-based signature scheme from lattices
• Deciding knowledge in security protocols under some e-voting theories
• On some incompatible properties of voting schemes
• Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
• Ceremonies for End-to-End Verifiable Elections
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Astrolabous: a universally composable time-lock encryption scheme
• Secure Stern Signatures in Quantum Random Oracle Model

This page was built for publication: Evaluating security of voting schemes in the universal composability framework

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