Cryptology ePrint Archive: Report 2017/251

A Lattice-Based Universal Thresholdizer for Cryptographic Systems

Dan Boneh and Rosario Gennaro and 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.

Category / Keywords: public-key cryptography / threshold cryptography, threshold signatures, lattices, fully homomorphic encryption

Date: received 19 Mar 2017, last revised 29 Sep 2017

Contact author: skim13 at cs stanford edu

Available format(s): PDF | BibTeX Citation

Note: This work is subsumed by ePrint report 2017/956.

Version: 20170929:155531 (All versions of this report)

Short URL: ia.cr/2017/251

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]