Somewhat homomorphic encryption based on random codes
From MaRDI portal
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Decoding one out of many
- Durandal: a rank metric based signature scheme
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Identity-based encryption from codes with rank metric
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- On constructing homomorphic encryption schemes from coding theory
- On the Complexity of the Rank Syndrome Decoding Problem
- On the edge-independence number and edge-covering number for regular graphs
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Structural attacks for public key cryptosystems based on Gabidulin codes
- TFHE: fast fully homomorphic encryption over the torus
- Theory of Cryptography
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- When Homomorphism Becomes a Liability
This page was built for publication: Somewhat homomorphic encryption based on random codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956606)
