Paper 2017/251

A Lattice-Based Universal Thresholdizer for Cryptographic Systems

Dan Boneh, Rosario Gennaro, Steven Goldfeder, and Sam Kim


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.

Available format(s)
Public-key cryptography
Publication info
Preprint. MINOR revision.
threshold cryptographythreshold signatureslatticesfully homomorphic encryption
Contact author(s)
skim13 @ cs stanford edu
2017-09-29: last of 2 revisions
2017-03-20: received
See all versions
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.