Fully homomorphic encryption from ring-LWE and security for key dependent messages
From MaRDI portal
(Redirected from Publication:5199210)
Recommendations
Cited in
(only showing first 100 items - show all)- Lattice-based key exchange on small integer solution problem
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- Lattice-based certificateless encryption scheme
- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- Bootstrapping for approximate homomorphic encryption
- Security considerations for Galois non-dual RLWE families
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- A note on Ring-LWE security in the case of fully homomorphic encryption
- CRT-based fully homomorphic encryption over the integers
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- LWE-based FHE with better parameters
- An efficient somewhat homomorphic encryption scheme based on factorization
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Discretisation and product distributions in ring-LWE
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- Boosting verifiable computation on encrypted data
- On the security of homomorphic encryption on approximate numbers
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- LPPRS: new location privacy preserving schemes based on ring signature over mobile social networks
- Flexible and efficient verifiable computation on encrypted data
- LWE from non-commutative group rings
- Efficient pseudorandom correlation generators from ring-LPN
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Deniable fully homomorphic encryption from learning with errors
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- Approximate homomorphic encryption with reduced approximation error
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- Tightly secure ring-LWE based key encapsulation with short ciphertexts
- The polynomial learning with errors problem and the smearing condition
- Asymptotically quasi-optimal cryptography
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Single-server private information retrieval with sublinear amortized time
- Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme
- Security estimates of a ring-LWE symmetric cryptosystem against chosen plaintext attack
- EPiC: efficient privacy-preserving counting for MapReduce
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Some security bounds for the key sizes of DGHV scheme
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
- Fully homomorphic SIMD operations
- Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme
- Error analysis of weak poly-LWE instances
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- Cryptographic algorithms for privacy-preserving online applications
- Secure MPC: laziness leads to GOD
- SLAP: simpler, improved private stream aggregation from ring learning with errors
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Additively homomorphic ring-LWE masking
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
- A novel fully homomorphic encryption scheme bsed on LWE
- (Leveled) fully homomorphic encryption without bootstrapping
- FHE circuit privacy almost for free
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Improved security for a ring-based fully homomorphic encryption scheme
- Ring switching in BGV-style homomorphic encryption
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Private computation on encrypted genomic data
- Efficient integer encoding for homomorphic encryption via ring isomorphisms
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- Fully homomophic encryption over the integers revisited
- A homomorphic proxy re-encryption from lattices
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Cryptanalysis of a homomorphic encryption scheme over integers
- Lattice-based FHE as secure as PKE
- The geometry of lattice cryptography
- Polly cracker, revisited
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
- Blending FHE-NTRU keys -- the excalibur property
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Secure statistical analysis using RLWE-based homomorphic encryption
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- Fractional LWE: a nonlinear variant of LWE
- Trapdoors for ideal lattices with applications
- Predicate encryption for circuits from LWE
- Provably weak instances of Ring-LWE
- Cryptanalysis of the co-ACD assumption
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- A simple BGN-type cryptosystem from LWE
- Toward basing fully homomorphic encryption on worst-case hardness
- Additively homomorphic encryption with \(d\)-operand multiplications
- Multikey fully homomorphic encryption and applications
- Attacks on the Search RLWE Problem with Small Errors
- Lattice-based identity-based homomorphic conditional proxy re-encryption for secure big data computing in cloud environment
- Packed ciphertexts in LWE-based homomorphic encryption
- A toolkit for ring-LWE cryptography
- Encoding of rational numbers and their homomorphic computations for FHE-based applications
- On the IND-CPA security of ring homomorphic encryption schemes over \(\mathbb{F}_2\)
- Private conjunctive query over encrypted data
- How to use indistinguishability obfuscation: deniable encryption, and more
- Algebraic aspects of solving ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
This page was built for publication: Fully homomorphic encryption from ring-LWE and security for key dependent messages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199210)
