18 search results - page 1 / 4 » Strengthening Digital Signatures Via Randomized Hashing |
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
CTRSA
2007
Springer
13 years 11 months ago
2007
Springer
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
STACS
2012
Springer
12 years 13 days ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
ACISP
2007
Springer
13 years 11 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 ...
ASIACRYPT
2011
Springer
12 years 4 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...