Cryptographic counters and applications to electronic voting

DOI10.1007/3-540-44987-6_6MaRDI QIDQ2778842zbMATH OpenFDO

Authors Steven Myers, Rafail Ostrovsky, Jonathan Katz

Publication date 21 March 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2045/20450078

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Financial Cryptography and Data Security
• Secure voting using partially compatible homomorphisms
• Universally verifiable MPC and IRV ballot counting
• Multi-authority secret-ballot elections with linear work
• Oblivious counter and majority protocol

Cited in

(9)

• Polynomial representation is tricky: maliciously secure private set intersection revisited
• Universally verifiable MPC and IRV ballot counting
• On the exact round complexity of best-of-both-worlds multi-party computation
• Benaloh's dense probabilistic encryption revisited
• Cryptographic voting -- a gentle introduction
• Homomorphic Encryptions of Sums of Groups
• Theory of Cryptography
• Financial Cryptography and Data Security
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials

This page was built for publication: Cryptographic counters and applications to electronic voting

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