Partially homomorphic encryption schemes over finite fields
From MaRDI portal
Publication:1989613
Recommendations
- Revisiting homomorphic encryption schemes for finite fields
- Partially homomorphic encryption
- Fully homomorphic encryption from the finite field isomorphism problem
- Fully homomorphic encryption over the integers
- Fully homomophic encryption over the integers revisited
- Fully homomorphic encryption over the integers with shorter public keys
- Homomorphic encryption
- Semi-homomorphic encryption and multiparty computation
- Homomorphic encryption and applications
- An efficient somewhat homomorphic encryption scheme based on factorization
Cited in
(12)- Homomorphic encryption systems statement: trends and challenges
- On constructing homomorphic encryption schemes from coding theory
- Revisiting homomorphic encryption schemes for finite fields
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- Applied homomorphic cryptography: examples
- Fully homomorphic encryption from the finite field isomorphism problem
- Private multiplication over finite fields
- Homomorphic cryptosystems and their applications.
- Communication Complexity in Algebraic Two-Party Protocols
- Partial covering sequences: a method for designing classes of cryptographic functions
- Bit Security of the CDH Problems over Finite Fields
- Partially homomorphic encryption
This page was built for publication: Partially homomorphic encryption schemes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1989613)