Fully homomorphic encryption using ideal lattices
From MaRDI portal
Recommendations
- (Leveled) fully homomorphic encryption without bootstrapping
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Efficient fully homomorphic encryption from (standard) LWE
Cited in
(only showing first 100 items - show all)- Some basics on privacy techniques, anonymization and their big data challenges
- Lattice-based key exchange on small integer solution problem
- Information security protocol based system identification with binary-valued observations
- Fine-grained secure computation
- Homomorphically encrypted arithmetic operations over the integer ring
- Lattice-based certificateless encryption scheme
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Practical private-key fully homomorphic encryption in rings
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Homomorphic lower digits removal and improved FHE bootstrapping
- Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data
- Bootstrapping for approximate homomorphic encryption
- An improved affine equivalence algorithm for random permutations
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- A compressive privacy approach to generalized information bottleneck and privacy funnel problems
- Private-key fully homomorphic encryption for private classification
- The hunting of the SNARK
- Fixed-point arithmetic in SHE schemes
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- Homomorphic secret sharing for low degree polynomials
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Privacy preserving distributed optimization using homomorphic encryption
- A full RNS variant of approximate homomorphic encryption
- Unsupervised Machine Learning on encrypted data
- Perennial secure multi-party computation of universal Turing machine
- Practical homomorphic message authenticators for arithmetic circuits
- Fully homomorphic encryption from the finite field isomorphism problem
- CRT-based fully homomorphic encryption over the integers
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- Security analysis of cryptosystems using short generators over ideal lattices
- On the deductive security of queries to databases with multi-bit records
- A new reversible date-hiding algorithm for encrypted images
- Efficient and secure outsourced approximate pattern matching protocol
- LWE-based FHE with better parameters
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Privacy preserving linear regression modeling of distributed databases
- An efficient somewhat homomorphic encryption scheme based on factorization
- Processing secure, verifiable and efficient SQL over outsourced database
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Polynomial expressions of \(p\)-ary auction functions
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- New publicly verifiable computation for batch matrix multiplication
- PRE: stronger security notions and efficient construction with non-interactive opening
- Oblivious DFA evaluation on joint input and its applications
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- A framework for cryptographic problems from linear algebra
- Delegating a product of group exponentiations with application to signature schemes
- Discretisation and product distributions in ring-LWE
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Privacy-preserving polynomial interpolation and its applications on predictive analysis
- Verifiable single-server private information retrieval from LWE with binary errors
- Private information retrieval with sublinear online time
- Candidate iO from homomorphic encryption schemes
- Compact NIZKs from standard assumptions on bilinear maps
- Boosting verifiable computation on encrypted data
- Post-quantum multi-party computation
- 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
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Bootstrapping fully homomorphic encryption over the integers in less than one second
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- A geometric approach to homomorphic secret sharing
- Flexible and efficient verifiable computation on encrypted data
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Functional encryption for set intersection in the multi-client setting
- Actively secure setup for SPDZ
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- Dynamic decentralized functional encryption
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Keyed-fully homomorphic encryption without indistinguishability obfuscation
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- Covert authentication from lattices
- Influence maximization in social networks with privacy protection
- Cryptanalytic extraction of neural network models
- Multi-server blind quantum computation protocol with limited classical communication among servers
- Blind polynomial evaluation and data trading
- Succinct non-interactive secure computation
- Hardness of LWE on general entropic distributions
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Compact ring signatures from learning with errors
- Impossibility of quantum virtual black-box obfuscation of classical circuits
- Deniable fully homomorphic encryption from learning with errors
- Counterexamples to new circular security assumptions underlying iO
- How to meet ternary LWE keys
- Towards faster polynomial-time lattice reduction
- Lower bounds on lattice sieving and information set decoding
- Evolving homomorphic secret sharing for hierarchical access structures
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
This page was built for publication: Fully homomorphic encryption using ideal lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172710)
