Homomorphic Encryption
From MaRDI portal
Publication:5021133
DOI10.1007/978-3-319-57048-8_5zbMath1481.94106OpenAlexW4251546625MaRDI QIDQ5021133
Publication date: 12 January 2022
Published in: Tutorials on the Foundations of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57048-8_5
Related Items (4)
Compressible FHE with applications to PIR ⋮ Homomorphic encryption: a mathematical survey ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ Balanced non-adjacent forms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- More on average case vs approximation complexity
- Probabilistic encryption
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Fully homomorphic SIMD operations
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Sanitization of FHE Ciphertexts
- (Leveled) fully homomorphic encryption without bootstrapping
- Practical Bootstrapping in Quasilinear Time
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Practical Multilinear Maps over the Integers
- How to Run Turing Machines on Encrypted Data
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Faster Bootstrapping with Polynomial Error
- Maliciously Circuit-Private FHE
- Algorithms in HElib
- Fully Homomorphic Encryption with Polylog Overhead
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Better Bootstrapping in Fully Homomorphic Encryption
- New Definitions and Separations for Circular Security
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Leveled Fully Homomorphic Signatures from Standard Lattices
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Lattice-based FHE as secure as PKE
- Homomorphic Encryption: From Private-Key to Public-Key
- Functional Encryption: Definitions and Challenges
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- New Algorithms for Learning in Presence of Errors
- Private information retrieval
- Multi-key FHE from LWE, Revisited
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Predicate Encryption for Circuits from LWE
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- A Simple BGN-Type Cryptosystem from LWE
- Additively Homomorphic Encryption with d-Operand Multiplications
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Evaluating Branching Programs on Encrypted Data
- A Survey on Polly Cracker Systems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A Pseudorandom Generator from any One-way Function
- When Homomorphism Becomes a Liability
- Candidate Multilinear Maps from Ideal Lattices
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Graph-Induced Multilinear Maps from Lattices
- On Ideal Lattices and Learning with Errors over Rings
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Classical hardness of learning with errors
- Theory of Cryptography
- Two Round Multiparty Computation via Multi-key FHE
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Homomorphic Encryption
