Fully Homomorphic Encryption Scheme without Key Switching 


Vol. 38,  No. 5, pp. 428-433, May  2013


PDF
  Abstract

We present a fully homomorphic encryption (FHE) scheme without key switching based on ring- learning with errors (RLWE) problems and some other assumption. Previous FHE schemes based on LWE needed a step called key switching to reduce the dimension of ciphertext. The key switching step actually needs a heavy computation and severe increasement of keys. So the key switching step is a big burden for implementing FHE Schemes. We suggest a FHE scheme without key switching step by reducing the dimension of ciphertexts in other way. Instead of throwing away key switching, we need another hardness assumption of the difficulty of solving quadratic equation over rings.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kim, S. Yoo, S. Lee, "Fully Homomorphic Encryption Scheme without Key Switching," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 5, pp. 428-433, 2013. DOI: .

[ACM Style]

Jae-Heon Kim, Sang-Kyung Yoo, and Sang-Han Lee. 2013. Fully Homomorphic Encryption Scheme without Key Switching. The Journal of Korean Institute of Communications and Information Sciences, 38, 5, (2013), 428-433. DOI: .

[KICS Style]

Jae-Heon Kim, Sang-Kyung Yoo, Sang-Han Lee, "Fully Homomorphic Encryption Scheme without Key Switching," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 5, pp. 428-433, 5. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880