20 search results - page 1 / 4 » On Defining Proofs of Knowledge in the Bare Public Key Model |
ICTCS
2007
Springer
14 years 5 months ago
2007
Springer
CORR
2006
Springer
13 years 11 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...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
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...
CRYPTO
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
CRYPTO
2005
Springer
14 years 4 months ago
2005
Springer
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]....