224 search results - page 13 / 45 » Isolated Proofs of Knowledge and Isolated Zero Knowledge |
150
Voted
CRYPTO
2001
Springer
15 years 10 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...
153
click to vote
EUROSYS
2008
ACM
16 years 2 months ago
2008
ACM
Causal request traces are valuable to developers of large concurrent and distributed applications, yet difficult to obtain. Traces show how a request is processed, and can be anal...
163
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
179
click to vote
SP
2008
IEEE
15 years 4 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...
166
Voted
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]....