Paper 2018/027
A verifiable shuffle for the GSW cryptosystem
Martin Strand
Abstract
We provide the first verifiable shuffle specifically for fully homomorphic schemes. A verifiable shuffle is a way to ensure that if a node receives and sends encrypted lists, the content will be the same, even though no adversary can trace individual list items through the node. Shuffles are useful in e-voting, traffic routing and other applications. We build our shuffle on the ideas and techniques of Groth's 2010 shuffle, but make necessary modifications for a less ideal setting where the randomness and ciphertexts admit no group structure. The protocol relies heavily on the properties of the so-called gadget matrices, so we have included a detailed introduction to these.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. MINOR revision.3nd Workshop on Advances in Secure Electronic Voting Schemes
- Keywords
- verifiable shufflefully homomorphic encryptionpost-quantum
- Contact author(s)
- martin strand @ ntnu no
- History
- 2018-01-07: received
- Short URL
- https://ia.cr/2018/027
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/027,
author = {Martin Strand},
title = {A verifiable shuffle for the GSW cryptosystem},
howpublished = {Cryptology ePrint Archive, Paper 2018/027},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/027}},
url = {https://eprint.iacr.org/2018/027}
}
