Multi-User Security Bound for Mixed Filter Permutators in the Random Oracle Model

At Eurocrypt’16, Méaux et al. designed a construction for symmetric ciphers that can be efficiently evaluated with Fully Homomorphic Encryption, dubbed Filter Permutator. They also specify FLIP, a family of Filter Permutators. Creating FiLIP, they improved their first construction using whitening keys and reduction of the initial key register. Later, Cosseron et al. and Hoffmann et al. proposed successive generalisations of their work, creating the new families of Group Filter Permutators and then Mixed Filter Permutators. In this article, we prove the generic security of Mixed Filter Permutators in the Random Oracle Model. Moreover, we study a derived scheme that avoids using whitening keys. We show that the resulting construction is less secure by providing an attack for some parameter choices that would yield a Mixed Filter Permutator that is secure in the Random Oracle Model. Finally, we prove a security bound for this Mixed Filter Permutators construction without the whitening key.

Authors

Institutions

Publication Details

Journal
IACR Transactions on Symmetric Cryptology
Published
2026-03-16
DOI
https://doi.org/10.46586/tosc.v2026.i1.5-30
Primary Topic
Cryptographic Implementations and Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-User Security Bound for Mixed Filter Permutators in the Random Oracle Model

Benoît Cogliati, Simon Demarty
IACR Transactions on Symmetric Cryptology
Cryptographic Implementations and Security
article

Multi-User Security Bound for Mixed Filter Permutators in the Random Oracle Model

Benoît Cogliati, Simon Demarty
article en

Abstract

At Eurocrypt’16, Méaux et al. designed a construction for symmetric ciphers that can be efficiently evaluated with Fully Homomorphic Encryption, dubbed Filter Permutator. They also specify FLIP, a family of Filter Permutators. Creating FiLIP, they improved their first construction using whitening keys and reduction of the initial key register. Later, Cosseron et al. and Hoffmann et al. proposed successive generalisations of their work, creating the new families of Group Filter Permutators and then Mixed Filter Permutators. In this article, we prove the generic security of Mixed Filter Permutators in the Random Oracle Model. Moreover, we study a derived scheme that avoids using whitening keys. We show that the resulting construction is less secure by providing an attack for some parameter choices that would yield a Mixed Filter Permutator that is secure in the Random Oracle Model. Finally, we prove a security bound for this Mixed Filter Permutators construction without the whitening key.

IACR Transactions on Symmetric CryptologyVol. 2026(1)
Centre National de la Recherche Scientifique (FR), Université de Versailles Saint-Quentin-en-Yvelines (FR), Université Paris-Saclay (FR), Thales (France) (FR), Laboratoire de Mathématiques Blaise Pascal (FR)
European Commission
Openalex Percentile: Top 23%
Cryptographic Implementations and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.