Paper 2017/251
A Lattice-Based Universal Thresholdizer for Cryptographic Systems
Dan Boneh, Rosario Gennaro, Steven Goldfeder, and Sam Kim
Abstract
We develop a general approach to thresholdizing a large class of (non-threshold) cryptographic schemes. We show how to add threshold functionality to CCA-secure public-key encryption (PKE), signature schemes, pseudorandom functions, and others primitives. To do so, we introduce a general tool, called a universal thresholdizer, from which many threshold systems are possible. The tool builds upon a lattice-based fully-homomorphic encryption (FHE) system. Applying the tool to a (non-threshold) lattice-based signature, gives the first single-round threshold signature from the learning with errors problem (LWE). Applying the tool to a (non-threshold) lattice-base CCA-secure PKE, gives a single-round lattice-based threshold CCA-secure PKE.
Note: This work is subsumed by ePrint report 2017/956.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- threshold cryptographythreshold signatureslatticesfully homomorphic encryption
- Contact author(s)
- skim13 @ cs stanford edu
- History
- 2017-09-29: last of 2 revisions
- 2017-03-20: received
- See all versions
- Short URL
- https://ia.cr/2017/251
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/251,
author = {Dan Boneh and Rosario Gennaro and Steven Goldfeder and Sam Kim},
title = {A Lattice-Based Universal Thresholdizer for Cryptographic Systems},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/251},
year = {2017},
url = {https://eprint.iacr.org/2017/251}
}
