Homomorphic encryption: a mathematical survey
From MaRDI portal
Publication:6118172
DOI10.4171/icm2022/165OpenAlexW4389775813MaRDI QIDQ6118172
Publication date: 20 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/icm2022/165
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Probabilistic encryption
- A hierarchy of polynomial time lattice basis reduction algorithms
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- Integer multiplication in time \(O(n\log n)\)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Sanitization of FHE Ciphertexts
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Fully Homomorphic Encryption with Polylog Overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomophic Encryption over the Integers Revisited
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Lattice-based FHE as secure as PKE
- Homomorphic Encryption: From Private-Key to Public-Key
- New Algorithms for Learning in Presence of Errors
- Polly Cracker, Revisited
- Constant depth circuits, Fourier transform, and learnability
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Classical Homomorphic Encryption for Quantum Circuits
- Quantum Algorithms for Some Hidden Shift Problems
- Algorithms for Black-Box Fields and their Application to Cryptography
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Computing arbitrary functions of encrypted data
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A theory of the learnable
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Nonmalleable Cryptography
- When Homomorphism Becomes a Liability
- Candidate Multilinear Maps from Ideal Lattices
- Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory
- Protecting Privacy through Homomorphic Encryption
- Homomorphic Encryption
- Fully homomorphic encryption using ideal lattices
- Quantum algorithms for solvable groups
- Obfuscation of Probabilistic Circuits and Applications
- General Impossibility of Group Homomorphic Encryption in the Quantum World
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Homomorphic encryption: a mathematical survey
