scientific article; zbMATH DE number 2085427

MaRDI QIDQ3043933zbMATH OpenFDO

Authors Aggelos Kiayias, Moti Yung

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2274/22740141.htm

zbMATH Keywords

dispute-freenessperfect ballot secrecyself-tallyingvoter privacyvoting schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Receipt-free secret-ballot elections (extended abstract)
• Financial Cryptography
• On some incompatible properties of voting schemes
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• scientific article; zbMATH DE number 2044526

Cited in

(13)

• Secret, verifiable auctions from elections
• A distributed networked system for secure publicly verifiable self-tallying online voting
• New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
• An information-theoretic model of voting systems
• Another twist in the dining cryptographers' protocol
• Short Ballot Assumption and Threeballot Voting Protocol
• How to obtain full privacy in auctions
• A smart contract for boardroom voting with maximum voter privacy
• Privacy-preserving voluntary-tallying leader election for Internet of Things
• Astrolabous: a universally composable time-lock encryption scheme
• Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
• Fully tally-hiding verifiable E-voting for real-world elections with seat-allocations
• Protecting the privacy of voters: new definitions of ballot secrecy for e-voting

This page was built for publication:

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