Keyed hash functions

S. Bakhtiari; R. Safavi-Naini; J. Pieprzyk

doi:10.1007/BFb0032342

Keyed hash functions

S. Bakhtiari, R. Safavi-Naini, J. Pieprzyk

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

26 Citations (Scopus)

Abstract

We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.

Original language	English
Title of host publication	Cryptography: Policy and Algorithms - International Conference, Proceedings
Place of Publication	Berlin ; New York
Publisher	Springer, Springer Nature
Pages	201-214
Number of pages	14
Volume	1029
ISBN (Print)	9783540607595
DOIs	https://doi.org/10.1007/BFb0032342
Publication status	Published - 1996
Externally published	Yes
Event	International Conference on Cryptographic Policy and Algorithms, 1995 - Brisbane, Australia Duration: 3 Jul 1995 → 5 Jul 1995

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1029
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	International Conference on Cryptographic Policy and Algorithms, 1995
Country/Territory	Australia
City	Brisbane
Period	3/07/95 → 5/07/95

Access to Document

10.1007/BFb0032342

Cite this

Bakhtiari, S., Safavi-Naini, R., & Pieprzyk, J. (1996). Keyed hash functions. In Cryptography: Policy and Algorithms - International Conference, Proceedings (Vol. 1029, pp. 201-214). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1029). Springer, Springer Nature. https://doi.org/10.1007/BFb0032342

@inproceedings{bae363822d564cddaf69336bb9833152,

title = "Keyed hash functions",

abstract = "We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.",

author = "S. Bakhtiari and R. Safavi-Naini and J. Pieprzyk",

year = "1996",

doi = "10.1007/BFb0032342",

language = "English",

isbn = "9783540607595",

volume = "1029",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "201--214",

booktitle = "Cryptography: Policy and Algorithms - International Conference, Proceedings",

address = "United States",

note = "International Conference on Cryptographic Policy and Algorithms, 1995 ; Conference date: 03-07-1995 Through 05-07-1995",

}

Bakhtiari, S, Safavi-Naini, R & Pieprzyk, J 1996, Keyed hash functions. in Cryptography: Policy and Algorithms - International Conference, Proceedings. vol. 1029, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1029, Springer, Springer Nature, Berlin ; New York, pp. 201-214, International Conference on Cryptographic Policy and Algorithms, 1995, Brisbane, Australia, 3/07/95. https://doi.org/10.1007/BFb0032342

Keyed hash functions. / Bakhtiari, S.; Safavi-Naini, R.; Pieprzyk, J.
Cryptography: Policy and Algorithms - International Conference, Proceedings. Vol. 1029 Berlin ; New York: Springer, Springer Nature, 1996. p. 201-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1029).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Keyed hash functions

AU - Bakhtiari, S.

AU - Safavi-Naini, R.

AU - Pieprzyk, J.

PY - 1996

Y1 - 1996

N2 - We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.

AB - We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.

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

U2 - 10.1007/BFb0032342

DO - 10.1007/BFb0032342

M3 - Conference proceeding contribution

AN - SCOPUS:77955516185

SN - 9783540607595

VL - 1029

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 201

EP - 214

BT - Cryptography: Policy and Algorithms - International Conference, Proceedings

PB - Springer, Springer Nature

CY - Berlin ; New York

T2 - International Conference on Cryptographic Policy and Algorithms, 1995

Y2 - 3 July 1995 through 5 July 1995

ER -

Bakhtiari S, Safavi-Naini R, Pieprzyk J. Keyed hash functions. In Cryptography: Policy and Algorithms - International Conference, Proceedings. Vol. 1029. Berlin ; New York: Springer, Springer Nature. 1996. p. 201-214. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0032342

Keyed hash functions

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this