Sciweavers

4 search results - page 1 / 1
» Does Secure Time-Stamping Imply Collision-Free Hash Function...
Sort
View
PROVSEC
2007
Springer
14 years 3 months ago
Does Secure Time-Stamping Imply Collision-Free Hash Functions?
Ahto Buldas, Aivo Jürgenson
ACNS
2006
Springer
117views Cryptology» more  ACNS 2006»
14 years 3 months ago
Do Broken Hash Functions Affect the Security of Time-Stamping Schemes?
We study the influence of collision-finding attacks on the security of time-stamping schemes. We distinguish between client-side hash functions used to shorten the documents befo...
Ahto Buldas, Sven Laur
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 3 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev