BROWSE

Related Researcher

Author

Yun, Aaram
Cryptography and Secure Computation Lab
Research Interests
  • Cryptography, complexity theory, computer security

ITEM VIEW & DOWNLOAD

A Simple Variant of the Merkle-Damgard Scheme with a Permutation

Cited 0 times inthomson ciCited 2 times inthomson ci
Title
A Simple Variant of the Merkle-Damgard Scheme with a Permutation
Author
Hirose, ShoichiPark, Je HongYun, Aaram
Keywords
Ideal cipher; Indifferentiability; MAC; Pseudo-random functions; Random Oracle
Issue Date
201204
Publisher
SPRINGER
Citation
JOURNAL OF CRYPTOLOGY, v.25, no.2, pp.271 - 309
Abstract
We propose a new composition scheme for hash functions. It is a variant of the Merkle-DamgAyenrd construction with a permutation applied right before the processing of the last message block. We analyze the security of this scheme using the indifferentiability formalism, which was first adopted by Coron et al. to the analysis of hash functions. We also study the security of simple MAC constructions out of this scheme. Finally, we discuss the random oracle indifferentiability of this scheme with a double-block-length compression function or the Davies-Meyer compression function composed of a block cipher.
URI
Go to Link
DOI
http://dx.doi.org/10.1007/s00145-010-9095-5
ISSN
0933-2790
Appears in Collections:
ECE_Journal Papers

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU