6 search results - page 1 / 2 » On the Round Complexity of Zero-Knowledge Proofs Based on On... |
105
click to vote
LATINCRYPT
2010
14 years 11 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
117
click to vote
EUROCRYPT
2010
Springer
15 years 6 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
106
click to vote
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
102
click to vote
TCC
2010
Springer
15 years 10 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
114
click to vote
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...