Todor Ristov

Learn More
We present a general way to get a provably collision-resistant hash function from any (suitable) Σ-protocol. This enables us to both get new designs and to unify and improve previous work. In the first category, we obtain, via a modified version of the Fiat-Shamir protocol, the fastest known hash function that is provably collision-resistant based on the(More)
This paper shows that chameleon hash functions and Sigma protocols are equivalent. We provide a transform of any suitable Sigma protocol to a chameleon hash function, and also show that any chameleon hash function is the result of applying our transform to some suitable Sigma protocol. This enables us to unify previous designs of chameleon hash functions,(More)
High throughput and fairness consist two desirable properties when scheduling traffic in an Input-Queued crossbar switch. Unfortunately, these two goals are conflicting which makes the job of most scheduling algorithms that want to achieve both hard. Here, we investigate the trade offs between throughput and fairness for iSLIP, one of the most well-studied(More)
  • 1