608 search results - page 28 / 122 » Interactive Oracle Proofs |
LICS
2003
IEEE
14 years 3 months ago
2003
IEEE
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
SACRYPT
1998
Springer
14 years 2 months ago
1998
Springer
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
CRYPTO
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
JUCS
2008
13 years 9 months ago
2008
Abstract: Recently, Au et al. [Au et al. 2007] pointed out a seemingly neglected security concern for certificateless public key encryption (CL-PKE) scheme, where a malicious key g...
BIRTHDAY
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. State-of-the-art proof presentation systems suffer from several deficiencies. First, they simply present the proofs without motivating why the proof is done as it is do...