37 search results - page 3 / 8 » Optimistic Concurrent Zero Knowledge |
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
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...
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 10 months ago
2006
IEEE
CRYPTO
1999
Springer
13 years 9 months ago
1999
Springer
