A novel fully homomorphic encryption scheme bsed on LWE
From MaRDI portal
Publication:2825264
DOI10.1007/s11859-016-1142-0zbMath1363.68072OpenAlexW2277498959WikidataQ120835832 ScholiaQ120835832MaRDI QIDQ2825264
Haifeng Lu, Xiumin Li, Xinguo Li, Yong Ding
Publication date: 6 October 2016
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-016-1142-0
Cites Work
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A novel fully homomorphic encryption scheme bsed on LWE