5 search results - page 1 / 1 » Concurrent Statistical Zero-Knowledge Arguments for NP from ... |
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we show a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Our transformatio...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...