7 search results - page 1 / 2 » Efficient Concurrent Zero-Knowledge in the Auxiliary String ... |
EUROCRYPT
2000
Springer
13 years 8 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...
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...
TAMC
2007
Springer
13 years 10 months ago
2007
Springer
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
TCC
2010
Springer
13 years 2 months ago
2010
Springer
FOCS
2000
IEEE
13 years 8 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...