Reference : Multi-user Security Bound for Filter Permutators in the Random Oracle Model
Scientific journals : Article
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/42327
Multi-user Security Bound for Filter Permutators in the Random Oracle Model
English
Cogliati, Benoît-Michel mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Tanguy, Titouan mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2019
Designs, Codes and Cryptography
Kluwer Academic Publishers
Yes (verified by ORBilu)
0925-1022
1573-7586
Netherlands
[en] Filter Permutators ; FLIP ; Related-Key attacks ; Random Oracle Model ; Provable Security
[en] At EUROCRYPT 2016, Méaux et al. introduced a new design
strategy for symmetric ciphers for Fully Homomorphic Encryption (FHE),
which they dubbed filter permutators. Although less efficient than classical
stream ciphers, when used in conjunction with an adequate FHE scheme,
they allow constant and small noise growth when homomorphically evaluating
decryption circuit. In this article, we present a security proof up to the birthday
bound (with respect to the size of the IV and the size of the key space) for this
new structure in the random oracle model and in the multi-user setting. In
particular, this result justifies the theoretical soundness of filter permutators.
We also provide a related-key attack against all instances of FLIP, a stream
cipher based on this design.
Researchers
http://hdl.handle.net/10993/42327
H2020 ; 644209 - HEAT - Homomorphic Encryption Applications and Technology

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
pure_information_theory.pdfAuthor postprint537.95 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.