EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
We suggest practical sub-linear size zero-knowledge arguments for statements involving linear algebra. Given commitments to matrices over a finite field, we give a sub-linear siz...