18 search results - page 3 / 4 » Strengthening Digital Signatures Via Randomized Hashing |
CCS
1999
ACM
13 years 10 months ago
1999
ACM
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
PKC
2010
Springer
13 years 10 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...
INFOCOM
2009
IEEE
14 years 27 days ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
ICNP
2006
IEEE
14 years 9 days ago
2006
IEEE
— File distribution via network coding has received a lot of attention lately. However, direct application of network coding may have security problems. In particular, attackers ...
CIT
2006
Springer
13 years 10 months ago
2006
Springer
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...