Paper 2020/264 Original: eprint.iacr.org/2020/264 ↗

Plaintext Recovery Attacks against Linearly Decryptable Fully Homomorphic Encryption Schemes

Nicholas Mainardi
Alessandro Barenghi
Gerardo Pelosi
Abstract

Homomorphic encryption primitives have the potential to be the main enabler of privacy preserving computation delegation to cloud environments. One of the avenues which has been explored to reduce their significant computational overhead with respect to cleartext computation is the one of the so-called noise-free homomorphic encryption schemes. In this work, we present an attack against fully homomorphic encryption primitives where a distinguisher for a single plaintext value exists. We employ two noise-free homomorphic encryption schemes where such a property holds as our case studies, providing detailed attack procedure against them. We validate the effectiveness and performance of our attacks on prototype implementations of the said schemes, and suggest two countermeasures to our attack tailored to the schemes at hand.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2020-03-04: last updated
2020-03-04: published
Short URL
https://ia.cr/2020/264
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2020/264,
      author = {Nicholas Mainardi and Alessandro Barenghi and Gerardo Pelosi},
      title = {Plaintext Recovery Attacks against Linearly Decryptable Fully Homomorphic Encryption Schemes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/264},
      year = {2020},
      url = {https://eprint.iacr.org/2020/264}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.