-
Notifications
You must be signed in to change notification settings - Fork 0
Home
Welcome to our GitHub project about Zero Knowledge.
Let us first introduce this project and the people behind it. The Crypto-Group at the department of computer science at Aarhus university has a long history of constructing cryptographic protocols. Cryptographic protocols are protocols exchange data and exhibit properties/guarantees towards one or more stakeholder related to security about that data like: integrity, authenticity or confidentiality.
One such example is Multi-party computation (MPC) protocols which allow a set of parties to jointly compute the result of a function of their private input such that the result is the only new information learned by any party.
Other examples include Zero-Knowledge protocols which is a two-party protocol between a Prover and a Verifier. The goal is for the Prover to convince the verifier that some NP-statement holds (and the Prover knows the witness).
Generic constructions for Zero-Knowledge protocols are few. One promising line of work in this area is a class of protocols based on circuit satisfiability. The asymptotically communication-complexity-wise fastest protocol is that of IKOS07 by Ishai et al. At its heart it uses the Scalable MPC protocol by Damgaard and Ishai from 2006 to achieve an extremely efficient construction. No need to say IKOS07 with DI06 is a somewhat complicated construction and the exact manifestation of DI06 plays a crucial role it the computational efficiency of the result. On the other hand we have a another line of work in RTZ14 by Ranellucci et al. where the protocol is asymptotically slower but excel by its simplicity and predictable constants.
In this work we report on implementations of both schemes RTZ14 and IKOS07 with DI06 to find the cross over point. E.g. the circuit size at which IKOS07 is preferred to RTZ14.