On homomorphic encryption using abelian groups: classical security analysis
From MaRDI portal
Recommendations
- General impossibility of group homomorphic encryption in the quantum world
- On non-Abelian homomorphic public-key cryptosystems
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Group homomorphic encryption: characterizations, impossibility results, and applications
- scientific article; zbMATH DE number 2196515
Cites work
- scientific article; zbMATH DE number 1256646 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 2103528 (Why is no real title available?)
- FHEW: bootstrapping homomorphic encryption in less than a second
- Finite group theory.
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Quantum computations: algorithms and error correction
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- Symbolic Collection using Deep Thought
- TFHE: fast fully homomorphic encryption over the torus
- The Parallel Complexity of Abelian Permutation Group Problems
- The quantum query complexity of the hidden subgroup problem is polynomial
This page was built for publication: On homomorphic encryption using abelian groups: classical security analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611632)
