License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2017.7
URN: urn:nbn:de:0030-drops-81901
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8190/
Applebaum, Benny ;
Haramaty-Krasne, Naama ;
Ishai, Yuval ;
Kushilevitz, Eyal ;
Vaikuntanathan, Vinod
Low-Complexity Cryptographic Hash Functions
Abstract
Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function.
The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output.
BibTeX - Entry
@InProceedings{applebaum_et_al:LIPIcs:2017:8190,
author = {Benny Applebaum and Naama Haramaty-Krasne and Yuval Ishai and Eyal Kushilevitz and Vinod Vaikuntanathan},
title = {{Low-Complexity Cryptographic Hash Functions }},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {7:1--7:31},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Christos H. Papadimitriou},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8190},
URN = {urn:nbn:de:0030-drops-81901},
doi = {10.4230/LIPIcs.ITCS.2017.7},
annote = {Keywords: Cryptography, hash functions, complexity theory, coding theory}
}
Keywords: |
|
Cryptography, hash functions, complexity theory, coding theory |
Collection: |
|
8th Innovations in Theoretical Computer Science Conference (ITCS 2017) |
Issue Date: |
|
2017 |
Date of publication: |
|
28.11.2017 |