Sciweavers

13 search results - page 1 / 3
» Impossibility and Feasibility Results for Zero Knowledge wit...
Sort
View
CRYPTO
2005
Springer
110views Cryptology» more  CRYPTO 2005»
13 years 9 months ago
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
Joël Alwen, Giuseppe Persiano, Ivan Visconti
TCC
2007
Springer
91views Cryptology» more  TCC 2007»
13 years 9 months ago
Lower Bounds for Non-interactive Zero-Knowledge
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
Hoeteck Wee
CRYPTO
2004
Springer
205views Cryptology» more  CRYPTO 2004»
13 years 9 months ago
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
CORR
2006
Springer
169views Education» more  CORR 2006»
13 years 3 months ago
Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model
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...
Yi Deng, Giovanni Di Crescenzo, Dongdai Lin
EUROCRYPT
2003
Springer
13 years 8 months ago
Resettable Zero-Knowledge in the Weak Public-Key Model
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...
Yunlei Zhao, Xiaotie Deng, Chan H. Lee, Hong Zhu