Skip to content

Threshold Cryptosystems From Threshold Fully Homomorphic Encryption

Year: 2017

type: technique collection: schemes status: auto

Links: ePrint 2017/956

Summary

Auto-extracted summary (unreviewed)

Develops a general method for adding threshold functionality to non-threshold cryptographic schemes. The authors construct a threshold fully homomorphic encryption scheme (TFHE) from LWE, introduce the notion of a universal thresholdizer built from it, and show how it thresholdizes CCA-secure PKE, signatures, PRFs and other primitives. Applying it to a lattice signature scheme yields the first single-round threshold signature scheme from LWE.

Abstract

We develop a general approach to adding a threshold functionality to a large class of (nonthreshold) 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 (TFHE) 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 TFHE. 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.
Source: pdf

Extracted details

Field Value Source Confidence
contribution Threshold fully homomorphic encryption from the LWE assumption llm 0.80
contribution New concept of a universal thresholdizer constructed from TFHE llm 0.80
contribution Generic thresholdization of CCA-secure PKE, signatures, PRFs and other primitives llm 0.80
contribution First single-round (one-round) threshold signature scheme from LWE llm 0.80
contribution Merge of two closely related prior works [BGGK17, JRS17] llm 0.80
schemes threshold FHE llm 0.80
schemes LWE-based FHE llm 0.80
schemes secret sharing llm 0.80
schemes lattice-based signatures llm 0.80
tasks threshold signatures llm 0.80
tasks threshold decryption llm 0.80
tasks threshold PRFs and key generation llm 0.80
threat model t-out-of-N threshold; adversary compromising t-1 servers learns nothing llm 0.80
interaction other llm 0.80
llm relevance low llm 0.80

Keyword mentions

Counts of vocabulary terms in the full text (first page of occurrence in brackets).

  • scheme: TFHE 238 [p.1], Secret sharing 90 [p.2], Function secret sharing 40 [p.3], Threshold HE 9 [p.1], Zero-knowledge proofs 6 [p.4], GSW 5 [p.4], Multi-key HE 5 [p.24], MPC 5 [p.4], Functional encryption 5 [p.2], RSA 3 [p.2]
  • technique: Non-interactive 15 [p.4]
  • assumption: Lattice-based 35 [p.1], LWE 26 [p.1]
  • task: Language modeling / generation 2 [p.29]
  • topic: Homomorphic encryption 205 [p.1]

Files

Path (under papers/) Collection Pages Size SHA-256 Note
references/schemes/s35-1_eprint-2017-956.pdf schemes 61 639.8 KB 8123d5e1ae1d

Database key: threshold-cryptosystems-from-threshold-fully-homomorphic-encryption · created 2026-11-05 · updated 2026-11-05 · edit with python3 tools/paperdb.py set threshold-cryptosystems-from-threshold-fully-homomorphic-encryption COLUMN VALUE