A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Salvaging Indifferentiability in a Multi-stage Setting
[chapter]
2014
Lecture Notes in Computer Science
Ristenpart, Shacham and Shrimpton (Eurocrypt 2011) recently presented schemes which are provably secure in the random-oracle model (ROM), but easily broken if the random oracle is replaced by typical indifferentiable hash constructions such as chop-MD or prefix-free-MD. They found that the indifferentiability framework, due to Maurer, Renner and Holenstein (TCC 2004), does not necessarily allow composition in multi-stage settings, that is, settings consisting of multiple disjoint adversarial
doi:10.1007/978-3-642-55220-5_33
fatcat:ve2gtr5yyvfblkht6igx4vqi5q