End-to-End Verifiable Elections in the Standard Model
作者： Aggelos Kiayias , Thomas Zacharias , Bingsheng Zhang
DOI: 10.1007/978-3-662-46803-6_16
关键词: Standard model (cryptography) 、 Random oracle 、 Mathematics 、 Randomness 、 Commitment scheme 、 Theoretical computer science 、 Bulletin board 、 Verifiable secret sharing 、 Cryptography 、 Scheme (programming language)
摘要: We present the cryptographic implementation of “DEMOS”, a new e-voting system that is end-to-end verifiable in standard model, i.e., without any additional “setup” assumption or access to random oracle (RO). Previously known systems required such assumptions (specifically, either existence “randomness beacon” were only shown secure RO model). In order analyze our scheme, we also provide modeling verifiability as well privacy and receipt-freeness encompasses previous definitions form two concise attack games.
springer.com
core.ac.uk
ed.ac.uk
sci-hub.st 参考文章(45)
Carsten Baum, Ivan Damgård, Claudio Orlandi, Publicly Auditable Secure Multi-Party Computation international conference on security and cryptography. pp. 175- 196 ,(2014) , 10.1007/978-3-319-10879-7_11
Ben Adida, Helios: web-based open-audit voting usenix security symposium. pp. 335- 348 ,(2008)
Silvio Micali, Paul Feldman, Manuel Blum, Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) symposium on the theory of computing. pp. 103- 112 ,(1988)
Moti Yung, Josh Cohen Benaloh, Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract). principles of distributed computing. pp. 52- 62 ,(1986)
Jens Groth, Evaluating Security of Voting Schemes in the Universal Composability Framework applied cryptography and network security. pp. 46- 60 ,(2004) , 10.1007/978-3-540-24852-1_4
Josh D. Cohen, Michael J. Fischer, A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract) foundations of computer science. pp. 372- 382 ,(1985)
Stefan Popoveniuc, Poorvi Vora, John Kelsey, Andrew Regenscheid, Performance requirements for end-to-end verifiable elections conference on electronic voting technology workshop on trustworthy elections. pp. 1- 16 ,(2010)
Juan Garay, Aggelos Kiayias, Nikos Leonardos, The Bitcoin Backbone Protocol: Analysis and Applications theory and application of cryptographic techniques. pp. 281- 310 ,(2015) , 10.1007/978-3-662-46803-6_10
Filip Zagórski, Richard T. Carback, David Chaum, Jeremy Clark, Aleksander Essex, Poorvi L. Vora, Remotegrity: design and use of an end-to-end verifiable remote voting system applied cryptography and network security. pp. 441- 457 ,(2013) , 10.1007/978-3-642-38980-1_28
Dominique Unruh, Jörn Müller-Quade, Universally composable incoercibility international cryptology conference. ,vol. 2009, pp. 411- 428 ,(2010) , 10.1007/978-3-642-14623-7_22