Show simple item record

dc.contributor.authorPass, Rafael
dc.contributor.authorTseng, Wei-Lung Dustin
dc.contributor.authorVenkitasubramaniam, Muthuramakrishnan
dc.date.accessioned2009-10-24T20:07:11Z
dc.date.available2009-10-24T20:07:11Z
dc.date.issued2009-10-24T20:07:11Z
dc.identifier.urihttps://hdl.handle.net/1813/14136
dc.descriptionItem removed from eCommons on 2010-02-21 at the request of the author.en_US
dc.description.abstractA long-standing open problem on the intersection of Complexity Theory and Cryptography is whether the security of cryptographic primitives can be based on the worst-case hardness of NP. We show that, unless coNP $\subseteq$ AM, collision-resistant hash functions---one of the most central cryptographic primitives---cannot be based on the worst-case hardness of NP using any randomized Turing reduction; previously such separations were established only for restricted (e.g. non-adaptive) types of reductions. Under an average-case strengthening of the assumption that coNP $\not\subseteq$ AM, we furthermore rule out generic---but potentially non-black-box---constructions of collision-resistant hash functions from one-way functions (using Turing reductions); as far as we know, this yields the first non-black-box separation between cryptographic primitives.en_US
dc.language.isoenen_US
dc.titleThe Complexity of Collision-Resistant Hashingen_US
dc.typereporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics