4 citations · 4 across the 1 of their papers we have counts for
1 paper
Thomas Holenstein, Robin Künzler, Stefano Tessaro
We consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is fo…