Low communication threshold fully homomorphic encryption

DOI10.1007/978-981-96-0875-1_10MaRDI QIDQ6955361zbMATH OpenFDO

Authors Alain Passelègue, Damien Stehlé

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0875-1_10

zbMATH Keywords

fully homomorphic threshold schemelearning with errors

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• An efficient and parallel Gaussian sampler for lattices
• BLEACH: cleaning errors in discrete computations over CKKS
• Bootstrapping bits with CKKS
• Classical hardness of learning with errors
• Efficient public key encryption based on ideal lattices (extended abstract)
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Homomorphic encryption for arithmetic of approximate numbers
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Multiparty reusable non-interactive secure computation from LWE
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the security of homomorphic encryption on approximate numbers
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Public Key Cryptography - PKC 2006
• Round-optimal lattice-based threshold signatures, revisited
• Securing approximate homomorphic encryption using differential privacy
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

Cited in

(5)

• Module learning with errors with truncated matrices
• Low communication threshold FHE from standard (module-)LWE
• IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
• HERDS: multi-key fully homomorphic encryption with sublinear bootstrapping
• HRA-secure homomorphic lattice-based proxy re-encryption with tight security

This page was built for publication: Low communication threshold fully homomorphic encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955361)