Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
From MaRDI portal
Recommendations
- Efficient fully homomorphic encryption from (standard) LWE
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Threshold cryptosystems from threshold fully homomorphic encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- (Leveled) fully homomorphic encryption without bootstrapping
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme
- Asymptotically quasi-optimal cryptography
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Encryption switching protocols
- FHE circuit privacy almost for free
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Hardness of LWE on general entropic distributions
- Homomorphic secret sharing from lattices without FHE
- scientific article; zbMATH DE number 1418319 (Why is no real title available?)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Lattice-based FHE as secure as PKE
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Lossiness and entropic hardness for ring-LWE
- mrNISC from LWE with polynomial modulus
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Multiparty reusable non-interactive secure computation from LWE
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On IND-qCCA security in the ROM and its applications. CPA security is sufficient for TLS 1.3
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the integer polynomial learning with errors problem
- On the security of homomorphic encryption on approximate numbers
- Rényi Divergence and Kullback-Leibler Divergence
- Rényi divergence measures for commonly used univariate continuous distributions
- Sanitization of FHE ciphertexts
- Short monotone formulae for the majority function
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Theory of Cryptography
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Topics in Cryptology – CT-RSA 2006
- Towards classical hardness of module-LWE: the linear rank case
- Worst-case to average-case reductions for module lattices
Cited in
(19)- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Willow: secure aggregation with one-shot clients
- Revisiting the security of approximate FHE with noise-flooding countermeasures
- Efficient verifiable mixnets from lattices, revisited
- Low communication threshold fully homomorphic encryption
- Partially non-interactive two-round lattice-based threshold signatures
- Improved universal thresholdizer from iterative Shamir secret sharing
- Two-round threshold lattice-based signatures from threshold homomorphic encryption
- A lattice-based IND-CCA threshold KEM from the BCHK+ transform
- Pilvi: lattice threshold PKE with small decryption shares and improved security
- Low communication threshold FHE from standard (module-)LWE
- Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth
- IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
- Optimal threshold traitor tracing
- Simulation-secure threshold PKE from LWE with polynomial modulus
- More efficient lattice-based electronic voting from NTRU
- Revisiting module lattice-based homomorphic encryption and application to secure-MPC
- IND-CCA lattice threshold KEM under 30 KiB
This page was built for publication: Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595688)
