Error-simulatable sanitization for TFHE and applications
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Actively secure setup for SPDZ
- An efficient and parallel Gaussian sampler for lattices
- Asynchronous secure computation
- Between a rock and a hard place: interpolating between MPC and FHE
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- FHE circuit privacy almost for free
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Gaussian Sampling in Lattice Based Cryptography
- Gaussian sampling over the integers: efficient, generic, constant-time
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Improved primitives for secure multiparty integer computation
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Lattice signatures and bimodal Gaussians
- Low communication threshold fully homomorphic encryption
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On lattices, learning with errors, random linear codes, and cryptography
- Parameter optimization and larger precision for (T)FHE
- Sampling exactly from the normal distribution
- Sampling the integers with low relative error
- Sanitization of FHE ciphertexts
- Security with functional re-encryption from CPA
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Simulation-secure threshold PKE from LWE with polynomial modulus
- TFHE public-key encryption revisited
- TFHE: fast fully homomorphic encryption over the torus
- Theory of Cryptography
- Theory of Cryptography
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst-case to average-case reductions based on Gaussian measures
This page was built for publication: Error-simulatable sanitization for TFHE and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390757)
