7 search results - page 1 / 2 » Generic Indifferentiability Proofs of Hash Designs |
113
click to vote
CSFW
2012
IEEE
13 years 1 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...
87
Voted
ASIACRYPT
2006
Springer
15 years 2 months ago
2006
Springer
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...
108
Voted
AMAST
2008
Springer
15 years 27 days ago
2008
Springer
Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generi...
92
Voted
AFRICACRYPT
2008
Springer
15 years 27 days ago
2008
Springer
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
105
Voted
TCC
2012
Springer
13 years 6 months ago
2012
Springer
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...