20 search results - page 3 / 4 » The Breaking of the AR Hash Function |
ACISP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...
ASIACRYPT
2003
Springer
14 years 25 days ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
PKC
2010
Springer
13 years 11 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
FSE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In Wang’s attack, message modifications allow to deterministically satisfy certain sufficient conditions to find collisions efficiently. Unfortunately, message modi...