ZOOM - IQC Math and CS Seminar - Speaker: Tony Metger, ETH Zurich
To use a cryptographic protocol in practice, one has to prove that it is secure against general attacks: even if an adversary performs a complicated attack involving all of the rounds of the protocol, they cannot compromise security. A much simpler task is to prove security against collective attacks, where the adversary is assumed to behave the same in each round. In this work, we develop a new information-theoretic tool, called the generalised entropy accumulation theorem (GEAT), for reducing security against general attacks to security against collective attacks. ...