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...
Saved in:
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 |
Similar Items
-
Variationally universal hashing
by: Ted Krovetz, et al.
Published: (2018) -
CBC MACs for arbitrary-length messages: The three-key constructions
by: John Black, et al.
Published: (2018) -
Practical pseudo-collisions for hash functions ARIRANG-224/384
by: Guo, Jian, et al.
Published: (2012) -
GPU implementation of a collision search for RIPEMD-128 hash function
by: Heng, Heok Hui
Published: (2016) -
SPN-hash: Improving the provable resistance against differential collision attacks
by: Choy, J., et al.
Published: (2014)