Abstract
A CPA secure multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings assumption is presented. We use canonical embedding to transform ring elements into vectors over Zq, and thus decrease encryption and decryption cost. Comparing with GHV scheme appeared in 2010, to encrypt n bits, this scheme can reduce encryption cost from O(n3/2) into O(nlog n). Finally, an efficient private information retrieval protocol that employs this scheme is presented.
| Original language | English |
|---|---|
| Pages (from-to) | 549-555 |
| Number of pages | 7 |
| Journal | Journal of Ambient Intelligence and Humanized Computing |
| Volume | 6 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 Oct 2015 |
| Externally published | Yes |
Keywords
- Canonical embedding
- Homomorphic encryption
- Private information retrieval
- RLWE assumption
Fingerprint
Dive into the research topics of 'How to build a faster private information retrieval protocol?'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver