608 search results - page 42 / 122 » Interactive Oracle Proofs |
WSC
2004
13 years 11 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
EUROCRYPT
2010
Springer
13 years 10 months ago
2010
Springer
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...
ISCI
2008
13 years 10 months ago
2008
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
INFORMATICALT
2006
13 years 10 months ago
2006
This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversa...