47 search results - page 1 / 10 » A Note on Security Proofs in the Generic Model |
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
ICICS
2005
Springer
13 years 11 months ago
2005
Springer
The notion of concurrent signatures was recently introduced by Chen, Kudla and Paterson. In concurrent signature schemes, two entities can produce two signatures that are not bindi...
ESORICS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
CSFW
2012
IEEE
11 years 7 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
BIRTHDAY
2010
Springer
13 years 6 months ago
2010
Springer
Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower...