Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur Graph Search.
Iterated attacks are comprised of iterating adversaries who can make plaintext queries, in each iteration to compute a bit, and are trying to distinguish between a random cipher and the ideal random cipher based on all bits. In EUROCRYPT '99, Vaudenay showed that a -decorrelated cipher resists to iterated attacks of order when iterations make almost no common queries. Then, he first asked what the necessary conditions are for a cipher to resist a non-adaptive iterated attack of order . Secondly, he speculated that repeating a plaintext query in different iterations does not provide any advantage to a non-adaptive distinguisher. We close here these two long-standing open problems. We show that, in order to resist non-adaptive iterated attacks of order , decorrelation of order is not sufficient. We do this by providing a counterexample consisting of a cipher decorrelated to the order and a successful non-adaptive iterated attack of order against it. Moreover, we prove that the aforementioned claim is wrong by showing that a higher probability of having a common query between different iterations can translate to a high advantage of the adversary in distinguishing from . We provide a counterintuitive example consisting of a cipher decorrelated to the order which can be broken by an iterated attack of order 1 having a high probability of common queries.
Daniel Patrick Collins, Subhadeep Banik, Willi Meier
Andrea Felice Caforio, Subhadeep Banik, Muhammed Fatih Balli