Homomorphic encryption
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- (Leveled) fully homomorphic encryption without bootstrapping
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- A Pseudorandom Generator from any One-way Function
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A simple BGN-type cryptosystem from LWE
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- A survey on Polly Cracker systems
- Additively homomorphic encryption with \(d\)-operand multiplications
- Algorithms in HElib
- Better bootstrapping in fully homomorphic encryption
- Bootstrapping for HElib
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Classical hardness of learning with errors
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Cryptography with constant computational overhead
- 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 Bootstrapping with Polynomial Error
- FHEW: bootstrapping homomorphic encryption in less than a second
- 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 with relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Fully homomorphic SIMD operations
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Graph-induced multilinear maps from lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic encryption: from private-key to public-key
- Homomorphic evaluation of the AES circuit
- How to run Turing machines on encrypted data
- scientific article; zbMATH DE number 5009196 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 691465 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 1996402 (Why is no real title available?)
- Implementing Gentry's fully-homomorphic encryption scheme
- Improved security for a ring-based fully homomorphic encryption scheme
- Lattice-based FHE as secure as PKE
- Leveled fully homomorphic signatures from standard lattices
- Maliciously circuit-private FHE
- More on average case vs approximation complexity
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- New Algorithms for Learning in Presence of Errors
- New definitions and separations for circular security
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Practical bootstrapping in quasilinear time
- Practical multilinear maps over the integers
- Predicate encryption for circuits from LWE
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Private information retrieval
- Probabilistic encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Public-key cryptosystems from the worst-case shortest vector problem
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Sanitization of FHE ciphertexts
- Theory of Cryptography
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two round multiparty computation via multi-key FHE
- When Homomorphism Becomes a Liability
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(28)- Practical private-key fully homomorphic encryption in rings
- Partially homomorphic encryption schemes over finite fields
- Compressible FHE with applications to PIR
- Homomorphic encryption for finite automata
- Fully homomorphic encryption in real world applications
- Applied homomorphic cryptography: examples
- Honey Encryption Beyond Message Recovery Security
- Cryptanalysis of chosen symmetric homomorphic schemes
- How to compute on encrypted data
- Shift-type homomorphic encryption and its application to fully homomorphic encryption
- Asymmetric Cryptography with a Hidden Monomial
- Homomorphic Encryption and Signatures from Vector Decomposition
- Advances in homomorphic cryptosystems
- Unification modulo homomorphic encryption
- Fully Secure Hidden Vector Encryption
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Partially homomorphic encryption
- Fully homomorphic encryption for mathematicians
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- Homomorphic encryption: a mathematical survey
- Computing primitive idempotents in finite commutative rings and applications
- Balanced non-adjacent forms
- An overview of torus fully homomorphic encryption
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- The application of homomorphism in cryptography
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- Two-server private information retrieval in sublinear time and quasilinear space
- Fully composable homomorphic encryption
This page was built for publication: Homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021133)
