Kryvos: Publicly tally-hiding verifiable e-voting
Elections are an important corner stone of democratic processes. In addition to publishing
the final result (eg, the overall winner), elections typically publish the full tally consisting of all …
the final result (eg, the overall winner), elections typically publish the full tally consisting of all …
Ordinos: A verifiable tally-hiding e-voting system
R Küsters, J Liedtke, J Müller… - 2020 IEEE European …, 2020 - ieeexplore.ieee.org
Modern electronic voting systems (e-voting systems) are designed to provide not only vote
privacy but also (end-to-end) verifiability. Several verifiable e-voting systems have been …
privacy but also (end-to-end) verifiability. Several verifiable e-voting systems have been …
Ballot secrecy and ballot independence coincide
B Smyth, D Bernhard - Computer Security–ESORICS 2013: 18th European …, 2013 - Springer
We study ballot independence for election schemes: We formally define ballot
independence as a cryptographic game and prove that ballot secrecy implies ballot …
independence as a cryptographic game and prove that ballot secrecy implies ballot …
Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios
B Smyth - Journal of Computer Security, 2021 - content.iospress.com
We propose a definition of ballot secrecy as an indistinguishability game in the
computational model of cryptography. Our definition improves upon earlier definitions to …
computational model of cryptography. Our definition improves upon earlier definitions to …
BBB-Voting: Self-Tallying End-to-End Verifiable 1-out-of-k Blockchain-Based Boardroom Voting
Voting is a means to agree on a collective decision based on available choices (eg,
candidates), where participants agree to abide by their outcome. To improve some features …
candidates), where participants agree to abide by their outcome. To improve some features …
Bbb-voting: 1-out-of-k blockchain-based boardroom voting
Voting is a means to agree on a collective decision based on available choices (eg,
candidates), where participants agree to abide by their outcome. To improve some features …
candidates), where participants agree to abide by their outcome. To improve some features …
[图书][B] Anonymous communication networks: Protecting privacy on the web
K Peng - 2014 - books.google.com
In today's interactive network environment, where various types of organizations are eager
to monitor and track Internet use, anonymity is one of the most powerful resources available …
to monitor and track Internet use, anonymity is one of the most powerful resources available …
Ballot secrecy with malicious bulletin boards
D Bernhard, B Smyth - Cryptology ePrint Archive, 2014 - eprint.iacr.org
We propose a definition of ballot secrecy in the computational model of cryptography. The
definition builds upon and strengthens earlier definitions by Bernhard et al.(ASIACRYPT'12 …
definition builds upon and strengthens earlier definitions by Bernhard et al.(ASIACRYPT'12 …
An efficient shuffling based eVoting scheme
K Peng - Journal of Systems and Software, 2011 - Elsevier
Among the two popular solutions to electronic voting, homomorphic tallying and shuffling,
the latter employs a simpler vote format, is more efficient (especially for the voters) and …
the latter employs a simpler vote format, is more efficient (especially for the voters) and …
Receipt-Freeness By Flexible Usage Of Mix Network
K Peng - 2023 18th Asia Joint Conference on Information …, 2023 - ieeexplore.ieee.org
Coercion-resistence is an important security property of private network applications like e-
voting, a common. Traditionally, its implementation depends on special and complicated …
voting, a common. Traditionally, its implementation depends on special and complicated …