5 search results - page 1 / 1 » Round-Optimal Zero-Knowledge Arguments Based on any One-Way ... |
74
Voted
EUROCRYPT
1997
Springer
15 years 1 months ago
1997
Springer
57
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
ASIACRYPT
2007
Springer
15 years 3 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...
85
Voted
EUROCRYPT
2000
Springer
15 years 1 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...
124
click to vote
TCC
2012
Springer
13 years 5 months ago
2012
Springer
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...