(Leveled) fully homomorphic encryption without bootstrapping
From MaRDI portal
Recommendations
- (Leveled) fully homomorphic encryption without bootstrapping
- Efficient fully homomorphic encryption from (standard) LWE
- Fully homomorphic encryption using ideal lattices
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
Cites work
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A hierarchy of polynomial time lattice basis reduction algorithms
- A sieve algorithm for the shortest lattice vector problem
- Additively homomorphic encryption with \(d\)-operand multiplications
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for HElib
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Evaluating Branching Programs on Encrypted Data
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster fully homomorphic encryption
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Homomorphic evaluation of the AES circuit
- Implementing Gentry's fully-homomorphic encryption scheme
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Probabilistic encryption
- Public-key cryptosystems from the worst-case shortest vector problem
- Ring switching in BGV-style homomorphic encryption
- Theory of Cryptography
Cited in
(only showing first 100 items - show all)- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- Leveled FHE with matrix message space
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes
- LWE-based FHE with better parameters
- A framework for cryptographic problems from linear algebra
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
- On the security of homomorphic encryption on approximate numbers
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Practical post-quantum password-authenticated key exchange based-on module-lattice
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Deniable fully homomorphic encryption from learning with errors
- A trace map attack against special ring-LWE samples
- Improving the efficiency of AES protocols in multi-party computation
- Faster homomorphic encryption over GPGPUs via hierarchical DGT
- An extension of Kannan's embedding for solving ring-based LWE problems
- 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
- Secure multiparty computation with sublinear preprocessing
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- Algebraically structured LWE. Revisited
- From FE combiners to secure MPC and back
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Flattening NTRU for evaluation key free homomorphic encryption
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Intelligent cryptography approach for secure distributed big data storage in cloud computing
- TFHE: fast fully homomorphic encryption over the torus
- Survey of information security
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Bootstrapping for helib
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- A multi-valued quantum fully homomorphic encryption scheme
- Maliciously secure matrix multiplication with applications to private deep learning
- SLAP: simpler, improved private stream aggregation from ring learning with errors
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- New cryptanalysis of LowMC with algebraic techniques
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- Sanitization of FHE ciphertexts
- Accelerating homomorphic computations on rational numbers
- A novel fully homomorphic encryption scheme bsed on LWE
- (Leveled) fully homomorphic encryption without bootstrapping
- Linear overhead optimally-resilient robust MPC using preprocessing
- 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
- Fully homomorphic encryption with polylog overhead
- Shift-type homomorphic encryption and its application to fully homomorphic encryption
- Breaking fully-homomorphic-encryption challenges. (Abstract)
- Ring switching in BGV-style homomorphic encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: bootstrapping homomorphic encryption in less than a second
- Multi-bit leveled homomorphic encryption via dual LWE-based
- Lattice-based FHE as secure as PKE
- Fully homomorphic encryption from approximate ideal lattices
- Faster fully homomorphic encryption
- Fractional LWE: a nonlinear variant of LWE
- On non-black-box simulation and the impossibility of approximate obfuscation
- Fully homomorphic encryption with auxiliary inputs
- Provably weak instances of Ring-LWE
- Optimization of bootstrapping in circuits
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
- Homomorphic encryption
- Practical FHE parameters against lattice attacks
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
- An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Cryptanalysis of Enhanced MORE
- Efficient fully homomorphic encryption from (standard) LWE
- Bootstrappable identity-based fully homomorphic encryption
- Leakage resilient fully homomorphic encryption
- BLEACH: cleaning errors in discrete computations over CKKS
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- MPClan: protocol suite for privacy-conscious computations
- Homomorphic encryption: a mathematical survey
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Private join and compute from PIR with default
- Balanced non-adjacent forms
- Revisiting homomorphic encryption schemes for finite fields
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion
- The direction of updatable encryption does matter
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- Coefficient grouping for complex affine layers
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- Accelerating HE operations from key decomposition technique
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
- HRA-secure attribute-based threshold proxy re-encryption from lattices
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs
- Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-Based GSW-FHE
- Analysis and prevention of averaging attacks against obfuscation protocols
- Verification protocol for stable matching from conditional disclosure of secrets
- Deniable cryptosystems: simpler constructions and achieving leakage resilience
- Full domain functional bootstrapping with least significant bit encoding
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
This page was built for publication: (Leveled) fully homomorphic encryption without bootstrapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q92720)
