405 search results - page 71 / 81 » Practice-Oriented Provable Security |
CTRSA
2005
Springer
14 years 1 months ago
2005
Springer
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
ISW
2004
Springer
14 years 26 days ago
2004
Springer
Due to the low entropy of human-memorable passwords, it is not easy to conduct password authenticated key agreement in a secure manner. Though there are many protocols achieving th...
SACRYPT
2004
Springer
14 years 25 days ago
2004
Springer
A reasonably efficient password based key exchange (KE) protocol with provable security without random oracle was recently proposed by Katz, et al. [18] and later by Gennaro and Li...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have propo...
EUROCRYPT
2010
Springer
13 years 10 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...