Threshold cryptosystems from threshold fully homomorphic encryption
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
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 single-round threshold signature scheme from LWE.
Original language | English |
---|---|
Title of host publication | Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings |
Editors | Alexandra Boldyreva, Hovav Shacham |
Number of pages | 32 |
Publisher | Springer |
Publication date | 2018 |
Pages | 565-596 |
ISBN (Print) | 9783319968834 |
DOIs | |
Publication status | Published - 2018 |
Externally published | Yes |
Event | 38th Annual International Cryptology Conference, CRYPTO 2018 - Santa Barbara, United States Duration: 19 Aug 2018 → 23 Aug 2018 |
Conference
Conference | 38th Annual International Cryptology Conference, CRYPTO 2018 |
---|---|
Land | United States |
By | Santa Barbara |
Periode | 19/08/2018 → 23/08/2018 |
Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10991 LNCS |
ISSN | 0302-9743 |
ID: 215083921