RIAL, Alfredo ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
ROENNE, Peter ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
RYAN, Peter Y A ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
(Universal) Unconditional Verifiability in E-Voting without Trusted Parties
D. L. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms, " Communications of the ACM, vol. 24, no. 2, pp. 84-90, 1981.
R. Cramer, R. Gennaro, and B. Schoenmakers, "A secure and optimally efficient multi-authority election scheme, " in Advances in Cryptology-EUROCRYPT'97, ser. Lecture Notes in Computer Science, W. Fumy, Ed., vol. 1233. Springer, May 1997, pp. 103-118.
I. Damgard and M. Jurik, "A generalisation, a simplification and some applications of Paillier's probabilistic public-key system, " in PKC 2001: 4th International Workshop on Theory and Practice in Public Key Cryptography, ser. Lecture Notes in Computer Science, K. Kim, Ed., vol. 1992. Springer, Feb. 2001, pp. 119-136.
P. Y. A. Ryan and S. A. Schneider, "Prêt à voter with re-encryption mixes, " University of Newcastle, Tech. Rep. CS-TR-956, 2006.
B. Adida, "Helios: Web-based open-audit voting. " in USENIX Security Symposium, vol. 17, 2008, pp. 335-348.
D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Y. A. Ryan, E. Shen, A. T. Sherman, and P. L. Vora, "Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes, " IEEE Trans. Information Forensics and Security, vol. 4, no. 4, pp. 611-627, 2009. [Online]. Available: http://dx. doi. org/10. 1109/TIFS. 2009. 2034919
P. Y. A. Ryan and V. Teague, "Pretty good democracy, " in IN: WORKSHOP ON SECURITY PROTOCOLS, 2009.
A. Juels, D. Catalano, and M. Jakobsson, "Coercion-resistant electronic elections, " in Towards Trustworthy Elections. Springer, 2010, pp. 37-63.
M. Blum, P. Feldman, and S. Micali, "Non-interactive zero-knowledge and its applications (extended abstract), " in 20th Annual ACM Symposium on Theory of Computing. ACM Press, May 1988, pp. 103-112.
A. De Santis, S. Micali, and G. Persiano, "Non-interactive zeroknowledge proof systems, " in Advances in Cryptology-CRYPTO'87, ser. Lecture Notes in Computer Science, C. Pomerance, Ed., vol. 293. Springer, Aug. 1988, pp. 52-72.
C. Rackoff and D. R. Simon, "Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, " in Advances in Cryptology-CRYPTO'91, ser. Lecture Notes in Computer Science, J. Feigenbaum, Ed., vol. 576. Springer, Aug. 1992, pp. 433-444.
O. Goldreich, Foundations of Cryptography: Basic Techniques. Cambridge, UK: Cambridge University Press, 2001, vol. 1.
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai, "Robust non-interactive zero knowledge, " in Advances in Cryptology-CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings, 2001, pp. 566-598.
M. Naor and M. Yung, "Public-key cryptosystems provably secure against chosen ciphertext attacks, " in 22nd Annual ACM Symposium on Theory of Computing. ACM Press, May 1990, pp. 427-437.
R. Cramer and V. Shoup, "Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack, " SIAM Journal on Computing, vol. 33, no. 1, pp. 167-226, 2003.
M. Bellare and P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols, " in ACM CCS 93: 1st Conference on Computer and Communications Security, V. Ashby, Ed. ACM Press, Nov. 1993, pp. 62-73.
A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems, " in Advances in Cryptology-CRYPTO'86, ser. Lecture Notes in Computer Science, A. M. Odlyzko, Ed., vol. 263. Springer, Aug. 1987, pp. 186-194.
G. Bertoni, J. Daemen, M. Peeters, and G. V. Assche, "The KECCAK reference, " 2011, http://keccak. noekeon. org/.
R. Canetti, O. Goldreich, and S. Halevi, "The random oracle methodology, revisited (preliminary version), " in 30th Annual ACM Symposium on Theory of Computing. ACM Press, May 1998, pp. 209-218.
S. Goldwasser and Y. T. Kalai, "On the (in)security of the Fiat-Shamir paradigm, " in 44th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Oct. 2003, pp. 102-115.
Y. T. Kalai, "Attacks on the fiat-shamir paradigm and program obfuscation, " Ph. D. dissertation, Massachusetts Institute of Technology, 2006.
N. Bitansky, D. Dachman-Soled, S. Garg, A. Jain, Y. T. Kalai, A. López-Alt, and D. Wichs, "Why "fiat-shamir for proofs" lacks a proof, " in Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Springer, 2013, pp. 182-201.
I. Damgard, N. Fazio, and A. Nicolosi, "Non-interactive zero-knowledge from homomorphic encryption, " in TCC 2006: 3rd Theory of Cryptography Conference, ser. Lecture Notes in Computer Science, S. Halevi and T. Rabin, Eds., vol. 3876. Springer, Mar. 2006, pp. 41-59.
Y. Lindell, "An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle, " in Theory of Cryptography-12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, 2015, pp. 93-109.
P. Chaidos and J. Groth, "Making sigma-protocols non-interactive without random oracles, " in Public-Key Cryptography-PKC 2015-18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30-April 1, 2015, Proceedings, 2015, pp. 650-670.
M. Ciampi, G. Persiano, L. Siniscalchi, and I. Visconti, "A transform for NIZK almost as efficient and general as the fiat-shamir transform without programmable random oracles, " in Theory of Cryptography-13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II, 2016, pp. 83-111.
H. Lipmaa, "Secure electronic voting protocols, " in Handbook of Information Security, Volume 2, Information Warfare, Social, Legal, and International Issues and Security Foundations, H. Bidgoli, Ed. John Wiley & Sons, Inc., 2005, pp. 647-657, electronic edition available at http://kodu. ut. ee/lipmaa/papers/voting4hb. pdf.
J. Groth, R. Ostrovsky, and A. Sahai, "Non-interactive zaps and new techniques for NIZK, " in Advances in Cryptology-CRYPTO 2006, ser. Lecture Notes in Computer Science, C. Dwork, Ed., vol. 4117. Springer, Aug. 2006, pp. 97-111.
C. Dwork and M. Naor, "Zaps and their applications, " in 41st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Nov. 2000, pp. 283-293.
B. Barak, S. J. Ong, and S. P. Vadhan, "Derandomization in cryptography, " in Advances in Cryptology-CRYPTO 2003, ser. Lecture Notes in Computer Science, D. Boneh, Ed., vol. 2729. Springer, Aug. 2003, pp. 299-315.
N. Bitansky and O. Paneth, "Zaps and non-interactive witness indistinguishability from indistinguishability obfuscation, " in Theory of Cryptography Conference. Springer, 2015, pp. 401-427.
J. Groth and A. Sahai, "Efficient non-interactive proof systems for bilinear groups, " in Advances in Cryptology-EUROCRYPT 2008, ser. Lecture Notes in Computer Science, N. P. Smart, Ed., vol. 4965. Springer, Apr. 2008, pp. 415-432.
M. Bellare, G. Fuchsbauer, and A. Scafuro, "Nizks with an untrusted CRS: security in the face of parameter subversion, " in Advances in Cryptology-ASIACRYPT 2016-22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 2016, pp. 777-804.
B. Abdolmaleki, K. Baghery, H. Lipmaa, and M. Zajkac, "A subversionresistant snark, " in International Conference on the Theory and Application of Cryptology and Information Security. Springer, 2017, pp. 3-33.
G. Fuchsbauer, "Subversion-zero-knowledge snarks, " in IACR International Workshop on Public Key Cryptography. Springer, 2018, pp. 315-347.
D. Boneh, A. Sahai, and B. Waters, "Functional encryption: Definitions and challenges, " in TCC 2011: 8th Theory of Cryptography Conference, ser. Lecture Notes in Computer Science, Y. Ishai, Ed., vol. 6597. Springer, Mar. 2011, pp. 253-273.
S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, and B. Waters, "Candidate indistinguishability obfuscation and functional encryption for all circuits, " in 54th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Oct. 2013, pp. 40-49.
S. Badrinarayanan, V. Goyal, A. Jain, and A. Sahai, "Verifiable functional encryption, " in Advances in Cryptology-ASIACRYPT 2016-22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 2016, pp. 557-587.
D. Boneh and M. K. Franklin, "Identity based encryption from the Weil pairing, " SIAM Journal on Computing, vol. 32, no. 3, pp. 586-615, 2003.
A. Joux, "A one round protocol for tripartite Diffie-Hellman, " Journal of Cryptology, vol. 17, no. 4, pp. 263-276, Sep. 2004.
D. Boneh, X. Boyen, and H. Shacham, "Short group signatures, " in Advances in Cryptology-CRYPTO 2004, ser. Lecture Notes in Computer Science, M. Franklin, Ed., vol. 3152. Springer, Aug. 2004, pp. 41-55.
M. Naor, "On cryptographic assumptions and challenges (invited talk), " in Advances in Cryptology-CRYPTO 2003, ser. Lecture Notes in Computer Science, D. Boneh, Ed., vol. 2729. Springer, Aug. 2003, pp. 96-109.
V. Iovino, A. Rial, P. B. Rønne, and P. Y. A. Ryan, " (universal) unconditional verifiability in e-voting without trusted parties, " IACR Cryptology ePrint Archive, vol. 2016, p. 975, 2016. [Online]. Available: http://eprint. iacr. org/2016/975
E. Ghadafi, N. P. Smart, and B. Warinschi, "Groth-Sahai proofs revisited, " in PKC 2010: 13th International Conference on Theory and Practice of Public Key Cryptography, ser. Lecture Notes in Computer Science, P. Q. Nguyen and D. Pointcheval, Eds., vol. 6056. Springer, May 2010, pp. 177-192.
J. Groth and R. Ostrovsky, "Cryptography in the multi-string model, " Journal of Cryptology, vol. 27, no. 3, pp. 506-543, Jul. 2014.
R. L. Rivest, "The threeballot voting system, " 2006.
B. Randell and P. Y. A. Ryan, "Voting technologies and trust, " in IEEE Security and Privacy, 2006, pp. 50-56.
P. Y. A. Ryan, P. B. Rønne, and V. Iovino, "Selene: Voting with transparent verifiability and coercion-mitigation, " in Financial Cryptography and Data Security-FC 2016 International Workshops, BITCOIN, VOTING, and WAHC, Christ Church, Barbados, February 26, 2016, Revised Selected Papers, 2016, pp. 176-192.
A. Kiayias and M. Yung, "Self-tallying elections and perfect ballot secrecy, " in PKC 2002: 5th International Workshop on Theory and Practice in Public Key Cryptography, ser. Lecture Notes in Computer Science, D. Naccache and P. Paillier, Eds., vol. 2274. Springer, Feb. 2002, pp. 141-158.
I. Damgard and M. Jurik, "A length-flexible threshold cryptosystem with applications, " in ACISP 03: 8th Australasian Conference on Information Security and Privacy, ser. Lecture Notes in Computer Science, R. Safavi-Naini and J. Seberry, Eds., vol. 2727. Springer, Jul. 2003, pp. 350-364.
J. Groth, "Efficient maximal privacy in boardroom voting and anonymous broadcast, " in International Conference on Financial Cryptography. Springer, 2004, pp. 90-104.
F. Hao, P. Y. A. Ryan, and P. Zielinski, "Anonymous voting by two-round public discussion, " IET Information Security, vol. 4, no. 2, pp. 62-67, 2010.
D. Khader, B. Smyth, P. Y. A. Ryan, and F. Hao, "A fair and robust voting system by broadcast, " in 5th International Conference on Electronic Voting 2012, (EVOTE 2012), Co-organized by the Council of Europe, Gesellschaft für Informatik and E-Voting. CC, July 11-14, 2012, Castle Hofen, Bregenz, Austria, 2012, pp. 285-299.
R. Giustolisi, V. Iovino, and P. Rønne, "On the possibility of noninteractive voting in the public-key setting, " in Financial Cryptography and Data Security-FC 2016 International Workshops, BITCOIN, VOTING, and WAHC, Christ Church, Barbados, February 26, 2016, Revised Selected Papers, 2016.
D. Bernhard, V. Cortier, D. Galindo, O. Pereira, and B. Warinschi, "Sok: A comprehensive analysis of game-based ballot privacy definitions, " in 2015 IEEE Symposium on Security and Privacy. IEEE, 2015, pp. 499-516.
V. Cortier and B. Smyth, "Attacking and fixing helios: An analysis of ballot secrecy, " Cryptology ePrint Archive, Report 2010/625, 2010, http://eprint. iacr. org/2010/625.
J. Benaloh, "Verifiable secret-ballot elections, " Ph. D. dissertation, Yale University, 1987.
U. Feige, D. Lapidot, and A. Shamir, "Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract), " in 31st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Oct. 1990, pp. 308-317.
W. Diffie and M. E. Hellman, "New directions in cryptography, " IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644-654, 1976.
A. C.-C. Yao, "How to generate and exchange secrets (extended abstract), " in 27th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Oct. 1986, pp. 162-167.
Y. Lindell and B. Pinkas, "A proof of security of Yao's protocol for twoparty computation, " Journal of Cryptology, vol. 22, no. 2, pp. 161-188, Apr. 2009.
S. Goldwasser, Y. T. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich, "Reusable garbled circuits and succinct functional encryption, " in 45th Annual ACM Symposium on Theory of Computing, D. Boneh, T. Roughgarden, and J. Feigenbaum, Eds. ACM Press, Jun. 2013, pp. 555-564.
A. Sahai and H. Seyalioglu, "Worry-free encryption: functional encryption with public keys, " in ACM CCS 10: 17th Conference on Computer and Communications Security, E. Al-Shaer, A. D. Keromytis, and V. Shmatikov, Eds. ACM Press, Oct. 2010, pp. 463-472.
S. Gorbunov, V. Vaikuntanathan, and H. Wee, "Functional encryption with bounded collusions via multi-party computation, " in Advances in Cryptology-CRYPTO 2012, ser. Lecture Notes in Computer Science, R. Safavi-Naini and R. Canetti, Eds., vol. 7417. Springer, Aug. 2012, pp. 162-179.
S. Garg, C. Gentry, S. Halevi, and M. Zhandry, "Functional encryption without obfuscation, " in Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II, E. Kushilevitz and T. Malkin, Eds. Springer, 2016, pp. 480-511.
R. Canetti, S. Halevi, and J. Katz, "Chosen-ciphertext security from identity-based encryption, " in Advances in Cryptology-EUROCRYPT 2004, ser. Lecture Notes in Computer Science, C. Cachin and J. Camenisch, Eds., vol. 3027. Springer, May 2004, pp. 207-222.
M. Green and S. Hohenberger, "Blind identity-based encryption and simulatable oblivious transfer, " in Advances in Cryptology-ASIACRYPT 2007, ser. Lecture Notes in Computer Science, K. Kurosawa, Ed., vol. 4833. Springer, Dec. 2007, pp. 265-282.
S. Goldwasser, S. D. Gordon, V. Goyal, A. Jain, J. Katz, F.-H. Liu, A. Sahai, E. Shi, and H.-S. Zhou, "Multi-input functional encryption, " in Advances in Cryptology-EUROCRYPT 2014, ser. Lecture Notes in Computer Science, P. Q. Nguyen and E. Oswald, Eds., vol. 8441. Springer, May 2014, pp. 578-602.
A. Kiayias, T. Zacharias, and B. Zhang, "End-to-end verifiable elections in the standard model, " in Advances in Cryptology-EUROCRYPT 2015-34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II, 2015, pp. 468-498.
N. Chondros, B. Zhang, T. Zacharias, P. Diamantopoulos, S. Maneas, C. Patsonakis, A. Delis, A. Kiayias, and M. Roussopoulos, "A distributed, end-to-end verifiable, internet voting system, " CoRR, vol. abs/1507. 06812, 2015. [Online]. Available: http://arxiv. org/abs/1507. 06812
A. Kiayias, T. Zacharias, and B. Zhang, "DEMOS-2: scalable E2E verifiable elections without random oracles, " in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015, 2015, pp. 352-363. [Online]. Available: https://doi. org/10. 1145/2810103. 2813727
T. Moran and M. Naor, "Receipt-free universally-verifiable voting with everlasting privacy, " in Advances in Cryptology-CRYPTO 2006, ser. Lecture Notes in Computer Science, C. Dwork, Ed., vol. 4117. Springer, Aug. 2006, pp. 373-392.
V. Cortier, D. Galindo, R. Küsters, J. Mueller, and T. Truderung, "Sok: Verifiability notions for e-voting protocols, " in IEEE Symposium on Security and Privacy, SP 2016, San Jose, CA, USA, May 22-26, 2016, 2016, pp. 779-798.
S. Kremer, M. Ryan, and B. Smyth, "Election verifiability in electronic voting protocols, " in European Symposium on Research in Computer Security. Springer, 2010, pp. 389-404.
J. C. Benaloh and D. Tuinstra, "Receipt-free secret-ballot elections (extended abstract), " in 26th Annual ACM Symposium on Theory of Computing. ACM Press, May 1994, pp. 544-553.
K. Sako and J. Kilian, "Receipt-free mix-type voting scheme-a practical solution to the implementation of a voting booth, " in Advances in Cryptology-EUROCRYPT'95, ser. Lecture Notes in Computer Science, L. C. Guillou and J.-J. Quisquater, Eds., vol. 921. Springer, May 1995, pp. 393-403.
M. Michels and P. Horster, "Some remarks on a receipt-free and universally verifiable mix-type voting scheme, " in Advances in Cryptology-ASIACRYPT'96, ser. Lecture Notes in Computer Science, K. Kim and T. Matsumoto, Eds., vol. 1163. Springer, Nov. 1996, pp. 125-132.
S. Delaune, S. Kremer, and M. Ryan, "Verifying privacy-type properties of electronic voting protocols, " Journal of Computer Security, vol. 17, no. 4, pp. 435-487, 2009. [Online]. Available: http://dx. doi. org/10. 3233/JCS-2009-0340
P. Chaidos, V. Cortier, G. Fuchsbauer, and D. Galindo, "Beleniosrf: A non-interactive receipt-free electronic voting scheme, " in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24-28, 2016, 2016, pp. 1614-1625, full version available at http://eprint. iacr. org/2015/629.
N. Bitansky, "Getting inside the adversary's head: New directions in nonblack-box knowledge extraction, " Ph. D. dissertation, Tel Aviv University, 2014.
J. Camenisch and V. Shoup, "Practical verifiable encryption and decryption of discrete logarithms, " in Advances in Cryptology-CRYPTO 2003, ser. Lecture Notes in Computer Science, D. Boneh, Ed., vol. 2729. Springer, Aug. 2003, pp. 126-144.
