Homomorphic encryption and some black box attacks
From MaRDI portal
Abstract: This paper is a compressed summary of some principal definitions and concepts in the approach to the black box algebra being developed by the authors. We suggest that black box algebra could be useful in cryptanalysis of homomorphic encryption schemes, and that homomorphic encryption is an area of research where cryptography and black box algebra may benefit from exchange of ideas.
Recommendations
Cites work
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
- Algorithms for black-box fields and their application to cryptography
- Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
- Finding Isomorphisms Between Finite Fields
- Fully homomorphic encryption using ideal lattices
- Implementing Gentry's fully-homomorphic encryption scheme
- New approaches in black box group theory.
- Practical homomorphic encryption over the integers for secure computation in the cloud
- The Complexity of Black-Box Ring Problems
Cited in
(8)- Cryptanalysis of an algebraic privacy homomorphism
- Algorithms for black-box fields and their application to cryptography
- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
- On Black-Box Ring Extraction and Integer Factorization
- Application of HX ring theory in homomorphic encryption
- Computing primitive idempotents in finite commutative rings and applications
- Degree of satisfiability in Heyting algebras
- Structural testing with homomorphic encryption
This page was built for publication: Homomorphic encryption and some black box attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039562)