Authors
Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter MR Rasmussen, Amit Sahai
Publication date
2018
Conference
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part I 38
Pages
565-596
Publisher
Springer International Publishing
Description
We develop a general approach to adding a threshold functionality to a large class of (non-threshold) cryptographic schemes. A threshold functionality enables a secret key to be split into a number of shares, so that only a threshold of parties can use the key, without reconstructing the key. We begin by constructing a threshold fully-homomorphic encryption scheme (ThFHE) from the learning with errors (LWE) problem. We next introduce a new concept, called a universal thresholdizer, from which many threshold systems are possible. We show how to construct a universal thresholdizer from our ThFHE. A universal thresholdizer can be used to add threshold functionality to many systems, such as CCA-secure public-key encryption (PKE), signature schemes, pseudorandom functions, and others primitives. In particular, by applying this paradigm to a (non-threshold) lattice signature system, we obtain the first …
Total citations
20182019202020212022202320246163238535612
Scholar articles
D Boneh, R Gennaro, S Goldfeder, A Jain, S Kim… - Advances in Cryptology–CRYPTO 2018: 38th Annual …, 2018
D Boneh, R Gennaro, S Goldfeder, S Kim - Cryptology ePrint Archive, 2017