Multicollisions and graph-based hash functions

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

1 Citation (Scopus)

Abstract

In this paper, we present some generalisations of previous multicollision finding methods and apply these against a new type of tree-based hash functions. We also show that the very general class of hash functions first presented by Nandi and Stinson can be understood as graph-based hash functions and a graph theoretical approach can be utilised in studying their properties. Previously, an efficient multicollision attack has been found against the basic iterated hash function construction. This method has been applied to the generalised iterated hash functions and binary tree-based hash functions. We show that similar methods can be utilised also against t-ary tree-based hash functions, simplify some definitions and conjecture a similar result for multicollisions against graph-based hash functions.

Original languageEnglish
Title of host publicationTrusted Systems, Intrust 2011
EditorsL. Cheng, M. Yung, L. Zhu
PublisherSpringer
Pages156-167
Number of pages12
ISBN (Electronic)978-3-642-32298-3
ISBN (Print)978-3-642-32297-6
DOIs
Publication statusPublished - 2012
MoE publication typeNot Eligible
Event3rd International Conference on Trusted Systems, INTRUST 2011 - Beijing, China
Duration: 27 Nov 201129 Nov 2011

Publication series

NameLecture Notes in Computer Science
Volume7222
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Trusted Systems, INTRUST 2011
CountryChina
CityBeijing
Period27/11/1129/11/11

Fingerprint

Hash functions
Hash Function
Graph in graph theory
Binary trees
Binary Tree
Simplify
Attack

Keywords

  • graphs
  • hash functions
  • multicollisions

Cite this

Halunen, K. (2012). Multicollisions and graph-based hash functions. In L. Cheng, M. Yung, & L. Zhu (Eds.), Trusted Systems, Intrust 2011 (pp. 156-167). Springer. Lecture Notes in Computer Science, Vol.. 7222 https://doi.org/10.1007/978-3-642-32298-3_11
Halunen, Kimmo. / Multicollisions and graph-based hash functions. Trusted Systems, Intrust 2011. editor / L. Cheng ; M. Yung ; L. Zhu. Springer, 2012. pp. 156-167 (Lecture Notes in Computer Science, Vol. 7222).
@inproceedings{bcce4a05097d418ab8b2d7a642ae2cf2,
title = "Multicollisions and graph-based hash functions",
abstract = "In this paper, we present some generalisations of previous multicollision finding methods and apply these against a new type of tree-based hash functions. We also show that the very general class of hash functions first presented by Nandi and Stinson can be understood as graph-based hash functions and a graph theoretical approach can be utilised in studying their properties. Previously, an efficient multicollision attack has been found against the basic iterated hash function construction. This method has been applied to the generalised iterated hash functions and binary tree-based hash functions. We show that similar methods can be utilised also against t-ary tree-based hash functions, simplify some definitions and conjecture a similar result for multicollisions against graph-based hash functions.",
keywords = "graphs, hash functions, multicollisions",
author = "Kimmo Halunen",
year = "2012",
doi = "10.1007/978-3-642-32298-3_11",
language = "English",
isbn = "978-3-642-32297-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "156--167",
editor = "L. Cheng and M. Yung and L. Zhu",
booktitle = "Trusted Systems, Intrust 2011",
address = "Germany",

}

Halunen, K 2012, Multicollisions and graph-based hash functions. in L Cheng, M Yung & L Zhu (eds), Trusted Systems, Intrust 2011. Springer, Lecture Notes in Computer Science, vol. 7222, pp. 156-167, 3rd International Conference on Trusted Systems, INTRUST 2011, Beijing, China, 27/11/11. https://doi.org/10.1007/978-3-642-32298-3_11

Multicollisions and graph-based hash functions. / Halunen, Kimmo.

Trusted Systems, Intrust 2011. ed. / L. Cheng; M. Yung; L. Zhu. Springer, 2012. p. 156-167 (Lecture Notes in Computer Science, Vol. 7222).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - Multicollisions and graph-based hash functions

AU - Halunen, Kimmo

PY - 2012

Y1 - 2012

N2 - In this paper, we present some generalisations of previous multicollision finding methods and apply these against a new type of tree-based hash functions. We also show that the very general class of hash functions first presented by Nandi and Stinson can be understood as graph-based hash functions and a graph theoretical approach can be utilised in studying their properties. Previously, an efficient multicollision attack has been found against the basic iterated hash function construction. This method has been applied to the generalised iterated hash functions and binary tree-based hash functions. We show that similar methods can be utilised also against t-ary tree-based hash functions, simplify some definitions and conjecture a similar result for multicollisions against graph-based hash functions.

AB - In this paper, we present some generalisations of previous multicollision finding methods and apply these against a new type of tree-based hash functions. We also show that the very general class of hash functions first presented by Nandi and Stinson can be understood as graph-based hash functions and a graph theoretical approach can be utilised in studying their properties. Previously, an efficient multicollision attack has been found against the basic iterated hash function construction. This method has been applied to the generalised iterated hash functions and binary tree-based hash functions. We show that similar methods can be utilised also against t-ary tree-based hash functions, simplify some definitions and conjecture a similar result for multicollisions against graph-based hash functions.

KW - graphs

KW - hash functions

KW - multicollisions

UR - http://www.scopus.com/inward/record.url?scp=84865676577&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-32298-3_11

DO - 10.1007/978-3-642-32298-3_11

M3 - Conference article in proceedings

SN - 978-3-642-32297-6

T3 - Lecture Notes in Computer Science

SP - 156

EP - 167

BT - Trusted Systems, Intrust 2011

A2 - Cheng, L.

A2 - Yung, M.

A2 - Zhu, L.

PB - Springer

ER -

Halunen K. Multicollisions and graph-based hash functions. In Cheng L, Yung M, Zhu L, editors, Trusted Systems, Intrust 2011. Springer. 2012. p. 156-167. (Lecture Notes in Computer Science, Vol. 7222). https://doi.org/10.1007/978-3-642-32298-3_11