32 search results - page 4 / 7 » Concurrent Non-Malleable Zero Knowledge |
EUROCRYPT
2000
Springer
13 years 10 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...
ASIACRYPT
2001
Springer
13 years 11 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...
ASIACRYPT
2007
Springer
14 years 26 days 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...
CRYPTO
1999
Springer
13 years 11 months ago
1999
Springer
CORR
2006
Springer
13 years 6 months ago
2006
Springer
In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledg...