Paper 2023/815 Original: eprint.iacr.org/2023/815 ↗

Noah's Ark: Efficient Threshold-FHE Using Noise Flooding

Morten Dahl
Daniel Demmler
Sarah El Kazdadi
Arthur Meyre
Jean-Baptiste Orfila
Dragos Rotaru
Nigel P. Smart
Samuel Tap
Michael Walter
Abstract

We outline a secure and efficient methodology to do threshold distributed decryption for LWE based Fully Homomorphic Encryption schemes. Due to the smaller parameters used in some FHE schemes, such as Torus-FHE (TFHE), the standard technique of ``noise flooding'' seems not to apply. We show that noise flooding can also be used with schemes with such small parameters, by utilizing a switch to a scheme with slightly higher parameters and then utilizing the efficient bootstrapping operations which TFHE offers. Our protocol is proved secure via a simulation argument, making its integration in bigger protocols easier to manage.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2023-10-17: last updated
2023-06-02: published
Short URL
https://ia.cr/2023/815
License
https://creativecommons.org/licenses/by-sa/4.0/

BibTeX

@misc{cryptoeprint:2023/815,
      author = {Morten Dahl and Daniel Demmler and Sarah El Kazdadi and Arthur Meyre and Jean-Baptiste Orfila and Dragos Rotaru and Nigel P. Smart and Samuel Tap and Michael Walter},
      title = {Noah's Ark: Efficient Threshold-FHE Using Noise Flooding},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/815},
      year = {2023},
      url = {https://eprint.iacr.org/2023/815}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.