Formalizing human ignorance collision-resistant hashing without the keys

There is a rarely mentioned foundational problem involving collision-resistant hash-functions: common constructions are keyless, but formal definitions are keyed. The discrepancy stems from the fact that a function H: {0,1}*→ {0, 1}nalways admits an efficient collision-finding algorithm, it's j...

Full description

Saved in:
Bibliographic Details
Main Author: Phillip Rogaway
Format: Book Series
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84887264252&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/61601
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-61601
record_format dspace
spelling th-cmuir.6653943832-616012018-09-11T08:58:55Z Formalizing human ignorance collision-resistant hashing without the keys Phillip Rogaway Computer Science Mathematics There is a rarely mentioned foundational problem involving collision-resistant hash-functions: common constructions are keyless, but formal definitions are keyed. The discrepancy stems from the fact that a function H: {0,1}*→ {0, 1}nalways admits an efficient collision-finding algorithm, it's just that us human beings might be unable to write the program down. We explain a simple way to sidestep this difficulty that avoids having to key our hash functions. The idea is to state theorems in a way that prescribes an explicitly-given reduction, normally a black-box one. We illustrate this approach using well-known examples involving digital signatures, pseudorandom functions, and the Merkle-Damgård construction. © Springer-Verlag Berlin Heidelberg 2006. 2018-09-11T08:55:51Z 2018-09-11T08:55:51Z 2006-12-01 Book Series 16113349 03029743 2-s2.0-84887264252 10.1007/11958239-14 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84887264252&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/61601
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Computer Science
Mathematics
spellingShingle Computer Science
Mathematics
Phillip Rogaway
Formalizing human ignorance collision-resistant hashing without the keys
description There is a rarely mentioned foundational problem involving collision-resistant hash-functions: common constructions are keyless, but formal definitions are keyed. The discrepancy stems from the fact that a function H: {0,1}*→ {0, 1}nalways admits an efficient collision-finding algorithm, it's just that us human beings might be unable to write the program down. We explain a simple way to sidestep this difficulty that avoids having to key our hash functions. The idea is to state theorems in a way that prescribes an explicitly-given reduction, normally a black-box one. We illustrate this approach using well-known examples involving digital signatures, pseudorandom functions, and the Merkle-Damgård construction. © Springer-Verlag Berlin Heidelberg 2006.
format Book Series
author Phillip Rogaway
author_facet Phillip Rogaway
author_sort Phillip Rogaway
title Formalizing human ignorance collision-resistant hashing without the keys
title_short Formalizing human ignorance collision-resistant hashing without the keys
title_full Formalizing human ignorance collision-resistant hashing without the keys
title_fullStr Formalizing human ignorance collision-resistant hashing without the keys
title_full_unstemmed Formalizing human ignorance collision-resistant hashing without the keys
title_sort formalizing human ignorance collision-resistant hashing without the keys
publishDate 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84887264252&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/61601
_version_ 1681425651109724160