Cryptology ePrint Archive: Report 2016/417
New Tools for Multi-Party Computation
Abstract: In this work we extend the electronic voting scheme introduced by R. Cramer, R. Gennaro and B. Schoenmakers in [CGS97]. In the original paper the privacy of votes is based on the decisional Diffie-Hellman or respectively the higher residuosity assumption. Since both problems can be solved efficiently in the event of quantum computers, a desirable goal is to implement the voting scheme with privacy based on different assumptions. We present the framework and a concrete instantiation for an efficient solution with privacy based on learning with errors over rings. Additionally we show how to achieve privacy assuming hardness of worst-case lattice problems, which are well analyzed and conjectured to be secure against quantum computers.
Category / Keywords: cryptographic protocols / lattice-based cryptography, electronic voting, learning with errors, learning with errors over rings
Date: received 27 Apr 2016
Contact author: lisa kohl at kit edu
Available format(s): PDF | BibTeX Citation
Note: This work is the Master's thesis of Lisa Kohl. It was developed in the research group Cryptology at the Centrum Wiskunde & Informatica under the supervision of Ronald Cramer in cooperation with the research group Cryptography and IT Security at the Karlsruhe Institute of Technology under the supervision of Dennis Hofheinz.
Version: 20160501:131336 (All versions of this report)
Short URL: ia.cr/2016/417
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]