62 search results - page 4 / 13 » A Dolev-Yao Model for Zero Knowledge |
ASIACRYPT
2004
Springer
14 years 27 days ago
2004
Springer
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
CRYPTO
2005
Springer
14 years 1 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]....
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
JCP
2008
13 years 7 months ago
2008
In order to implement both the efficiency and security in the Peer-to-Peer (P2P) network, we design a trusted small world overlay P2P network with the role based and reputation bas...
CRYPTO
2009
Springer
14 years 2 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...