62 search results - page 4 / 13 » A Dolev-Yao Model for Zero Knowledge |
154
click to vote
ASIACRYPT
2004
Springer
15 years 11 months 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...
170
click to vote
CRYPTO
2005
Springer
15 years 11 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]....
145
click to vote
ASIACRYPT
2000
Springer
15 years 10 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...
181
click to vote
JCP
2008
15 years 6 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...
159
click to vote
CRYPTO
2009
Springer
16 years 16 days 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...