Decryption phase in Norwegian electronic voting

Authors

  • Anders Smedstuen Lund Norwegian University of Science and Technology
  • Martin Strand Norwegian University of Science and Technology

Abstract

We describe an efficient and secure decryption protocol to the Norwegian Internet voting project. We first adapt Groth’s shuffledecryption from 2010 to our purpose, and we prove all security properties in the random oracle model. We then describe the complete decryption algorithm, and prove that it maintains the security of the
rest of the protocol.

Author Biographies

Anders Smedstuen Lund, Norwegian University of Science and Technology

Department of Mathematical Sciences

Martin Strand, Norwegian University of Science and Technology

Department of Mathematical Sciences

References

Stephanie Bayer and Jens Groth. Efficient zero-knowledge argument for
correctness of a shuffle. In David Pointcheval and Thomas Johansson, editors,
Advances in Cryptology - EUROCRYPT 2012, volume 7237 of Lecture Notes
in Computer Science, pages 263–280. Springer, 2012.

Ivan Damgård, Kasper Dupont, and Michael Østergaard Pedersen. Unclonable
group identification. In Serge Vaudenay, editor, EUROCRYPT, volume
4004 of Lecture Notes in Computer Science, pages 555–572. Springer, 2006.

Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions
to identification and signature problems. In Andrew M. Odlyzko, editor,
CRYPTO, volume 263 of Lecture Notes in Computer Science, pages 186–194.
Springer, 1986.

Jun Furukawa. Efficient and verifiable shuffling and shuffle-decryption. IEICE
Transactions, 88-A(1):172–188, 2005.

Jun Furukawa and Kazue Sako. An efficient scheme for proving a shuffle.
In Joe Kilian, editor, CRYPTO, volume 2139 of Lecture Notes in Computer
Science, pages 368–387. Springer, 2001.

Kristian Gjøsteen. A latency-free election scheme. In Tal Malkin, editor,
CT-RSA, volume 4964 of Lecture Notes in Computer Science, pages 425–436.
Springer, 2008.

Kristian Gjøsteen. The Norwegian internet voting protocol. Cryptology ePrint
Archive, Report 2013/473, 2013. http://eprint.iacr.org/.

Kristian Gjøsteen and Anders Smedstuen Lund. The Norwegian internet
voting protocol: A new instantiation. Cryptology ePrint Archive, Report
2015/503, 2015. http://eprint.iacr.org/.

Jens Groth. A verifiable secret shuffle of homomorphic encryptions. In Yvo
Desmedt, editor, Public Key Cryptography, volume 2567 of Lecture Notes in
Computer Science, pages 145–160. Springer, 2003.

Jens Groth. A verifiable secret shuffle of homomorphic encryptions. J.
Cryptology, 23(4):546–579, 2010.

Chae Hoon Lim. Efficient multi-exponentiation and applications to batch
verification of digital signatures. Available at http://dasan.sejong.ac.kr/
~chlim/pub/multi_exp.ps., 2000.

Chae Hoon Lim and Pil Joong Lee. More flexible exponentiation with
precomputation. In Yvo Desmedt, editor, CRYPTO, volume 839 of Lecture
Notes in Computer Science, pages 95–107. Springer, 1994.

C. Andrew Neff. A verifiable secret shuffle and its application to e-voting.
In Proceedings of the 8th ACM conference on Computer and Communications
Security, CCS ’01, pages 116–125, New York, NY, USA, 2001. ACM.

C. Andrew Neff. Verifiable mixing (shuffling) of ElGamal pairs. Technical
report, In proceedings of PET ’03, LNCS series, 2003.

Ministry of Local Government and Modernisation. Internet voting pilot to
be discontinued. Internet, jun 2014. https://www.regjeringen.no/en/
aktuelt/Internet-voting-pilot-to-be-discontinued/id764300/.

Torben P. Pedersen. Non-interactive and information-theoretic secure
verifiable secret sharing. In Proceedings of the 11th Annual International
Cryptology Conference on Advances in Cryptology, CRYPTO ’91, pages 129–
140, London, UK, UK, 1992. Springer-Verlag.

Kun Peng, Ed Dawson, and Feng Bao. Modification and optimisation of a
shuffling scheme: stronger security, formal analysis and higher efficiency. Int.
J. Inf. Sec., 10(1):33–47, 2011.

Signe Bock Segaard, Dag Arne Christensen, Bjarte Folkestad, and Jo Saglie.
Internettvalg. Institutt for samfunnsforskning, 2014. English summary available
at https://www.regjeringen.no/globalassets/upload/kmd/komm/
rapporter/isf_internettvalg_english-summary.pdf.

Martin Strand. Verifiable shuffled decryption, 2013. Master thesis. Available
at https://brage.bibsys.no/xmlui/handle/11250/259169.

Björn Terelius and Douglas Wikström. Proofs of restricted shuffles. In
Daniel J. Bernstein and Tanja Lange, editors, AFRICACRYPT, volume 6055
of Lecture Notes in Computer Science, pages 100–113. Springer, 2010.

Published

2016-11-30

Issue

Section

Norsk Informasjonssikkerhetskonferanse 2016