Abstract. Different security notions and settings for identification protocols have been proposed so far, considering different powerful adversaries that can play "man-in-the-...
Carlo Blundo, Giuseppe Persiano, Ahmad-Reza Sadegh...
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...