Paper 2016/417
New Tools for Multi-Party Computation
Lisa Kohl
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.
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.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- lattice-based cryptographyelectronic votinglearning with errorslearning with errors over rings
- Contact author(s)
- lisa kohl @ kit edu
- History
- 2016-05-01: received
- Short URL
- https://ia.cr/2016/417
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/417,
author = {Lisa Kohl},
title = {New Tools for Multi-Party Computation},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/417},
year = {2016},
url = {https://eprint.iacr.org/2016/417}
}
