On chosen target forced prefix preimage resistance
Rjaško, Michal
Tatra Mountains Mathematical Publications, Tome 49 (2011), / Harvested from Mathematical Institute
Link
Link

In this paper we analyze the chosen target forced prefix(CTFP) preimage resistance security notion for hash functions rstly introduced by Kelsey and Kohno with the Nostradamus attack [4]. We give a formal denition of this property in hash function family settings and work out all the implications and separations between CTFP preimage resistance and other standard notions of hash function security (preimage resistance, collision resistance, etc.). This paper follows the work of Rogaway and Shrimpton [6], where they dened seven basic notions of hash function security and examined all the relationships among these notions. We also dene a new property for security of hash function families { always CTFP preimage resistance, which guarantees CTFP security for all the hash functions in the family

Publié le : 2011-01-01
DOI : https://doi.org/10.2478/tatra.v47i0.55 
@article{55,
     title = {On chosen target forced prefix preimage resistance},
     journal = {Tatra Mountains Mathematical Publications},
     volume = {49},
     year = {2011},
     doi = {10.2478/tatra.v47i0.55},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/55}
}

Rjaško, Michal. On chosen target forced prefix preimage resistance. Tatra Mountains Mathematical Publications, Tome 49 (2011) . doi : 10.2478/tatra.v47i0.55. http://gdmltest.u-ga.fr/item/55/