199 search results - page 11 / 40 » Adaptive Proofs of Knowledge in the Random Oracle Model |
119
click to vote
CRYPTO
2011
Springer
13 years 11 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
COCO
2010
Springer
15 years 3 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
EUROCRYPT
2004
Springer
15 years 4 months ago
2004
Springer
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
ASIACRYPT
2000
Springer
15 years 3 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...
KI
2009
Springer
15 years 5 months ago
2009
Springer
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem prover...