Designs for practical SHE schemes based on Ring-LWR
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- A toolkit for ring-LWE cryptography
- Advances in Cryptology - EUROCRYPT 2004
- An improved RNS variant of the BFV homomorphic encryption scheme
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for BGV and BFV revisited
- Bootstrapping for helib
- Compressible FHE with applications to PIR
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient public key encryption based on ideal lattices (extended abstract)
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- FHEW: bootstrapping homomorphic encryption in less than a second
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
- High precision discrete Gaussian sampling on FPGAs
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping
- How to enumerate LWE keys as narrow as in \textsc{Kyber}/\textsc{Dilithium}
- How to meet ternary LWE keys
- Improved classical and quantum algorithms for subset-sum
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
- Improved power analysis attacks on Falcon
- Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
- More efficient commitments from structured lattice assumptions
- Multiparty Computation from Somewhat Homomorphic Encryption
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- On the concrete hardness of learning with errors
- Pseudorandom functions and lattices
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Revisiting homomorphic encryption schemes for finite fields
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Trapdoors for hard lattices and new cryptographic constructions
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Which ring based somewhat homomorphic encryption scheme is best?
This page was built for publication: Designs for practical SHE schemes based on Ring-LWR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326608)
