Search Results

Documents authored by Bertoni, Guido

Document
DOI: 10.4230/DagSemProc.09031.15
Sufficient conditions for sound tree hashing modes

Authors: Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche

Published in: Dagstuhl Seminar Proceedings, Volume 9031, Symmetric Cryptography (2009)

Abstract
We consider the general case of tree hashing modes that make use of an underlying compression function. We consider such a tree hashing mode sound if differentiating it from a random oracle, assuming the underlying compression function is a random oracle can be proven to be hard. We demonstrate two properties that such a tree hashing mode must have for such a proof to exist. For each of the two properties we show that several solutions exist to realize them. For some given solutions we demonstrate that a simple proof of indifferentiability exists and obtain an upper bound on the differentiability probability of $q^2/2^n$ with $q$ the number of queries to the underlying compression function and $n$ its output length. Finally we give two examples of hashing modes for which this proof applies: KeccakTree and Prefix-free Merkle-Damgard.
Cite as

Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche. Sufficient conditions for sound tree hashing modes. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 9031, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{bertoni_et_al:DagSemProc.09031.15,
  author =	{Bertoni, Guido and Daemen, Joan and Peeters, Micha\"{e}l and Van Assche, Gilles},
  title =	{{Sufficient conditions for sound tree hashing modes}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9031},
  editor =	{Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09031.15},
  URN =		{urn:nbn:de:0030-drops-19463},
  doi =		{10.4230/DagSemProc.09031.15},
  annote =	{Keywords: Tree Hashing, Indifferentiability}
}
Document
DOI: 10.4230/DagSemProc.09031.17
The Road from Panama to Keccak via RadioGatún

Authors: Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche

Published in: Dagstuhl Seminar Proceedings, Volume 9031, Symmetric Cryptography (2009)

Abstract
In this presentation, we explain the design choices of Panama [1] and RadioGatun [2], which lead to Keccak [3]. After a brief recall of Panama, RadioGatun and the trail backtracking cost, we focus on three important aspects. First, we explain the role of the belt in the light of differential trails. Second, we discuss the relative advantages of a block mode hash function compared to a stream mode one. Finally, we point out why Panama and RadioGatun are not sponge functions and why their design philosophy differs from that of Keccak. [1] J. Daemen and C. S. K. Clapp, FSE 1998 [2] G. Bertoni et al., NIST Hash Workshop 2006 [3] G. Bertoni et al., SHA-3 submission, 2008
Cite as

Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche. The Road from Panama to Keccak via RadioGatún. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 9031, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{bertoni_et_al:DagSemProc.09031.17,
  author =	{Bertoni, Guido and Daemen, Joan and Peeters, Micha\"{e}l and Van Assche, Gilles},
  title =	{{The Road from Panama to Keccak via RadioGat\'{u}n}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9031},
  editor =	{Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09031.17},
  URN =		{urn:nbn:de:0030-drops-19587},
  doi =		{10.4230/DagSemProc.09031.17},
  annote =	{Keywords: Hash function, cryptography}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact