48 search results - page 3 / 10 » Precise Concurrent Zero Knowledge |
EUROCRYPT
2000
Springer
15 years 3 months ago
2000
Springer
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
97
Voted
ASIACRYPT
2001
Springer
15 years 4 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...
97
Voted
CORR
2006
Springer
14 years 11 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...
78
Voted
ASIACRYPT
2007
Springer
15 years 5 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...
67
Voted
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE