152 search results - page 7 / 31 » Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use |
116
click to vote
CRYPTO
2005
Springer
15 years 6 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]....
CRYPTO
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
127
click to vote
SP
2008
IEEE
14 years 11 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
107
click to vote
EUROCRYPT
2000
Springer
15 years 4 months ago
2000
Springer
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
98
Voted
EUROCRYPT
2006
Springer
15 years 4 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...