From graphs to keyed quantum hash functions

DOI10.1134/S1995080216060202MaRDI QIDQ2361672zbMATH OpenFDO

Authors Yanyan Li

Publication date 30 June 2017

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.00256

zbMATH Keywords

message authenticationextractorexpander graphquantum hash functionkeyed quantum hash function

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60) Structural characterization of families of graphs (05C75)

Abstract: We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them. We also propose a keyed quantum hash function based on extractor function that can be used in quantum message authentication codes and assess its security in a limited attacker model.

Recommendations

• Quantum hashing via \(\varepsilon \)-universal hashing constructions and Freivalds' fingerprinting schemas
• Constructing quantum hash functions based on quantum walks on Johnson graphs
• Quantum hashing. Group approach
• Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
• On the concept of quantum hashing

Cites work

• scientific article; zbMATH DE number 1456817 (Why is no real title available?)
• An introduction to randomness extractors
• Cryptographic hash functions from expander graphs
• Expander graphs and their applications
• Near-optimal extractors against quantum storage
• Quantum hashing for finite abelian groups
• Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
• Quantum hashing. Group approach
• Short seed extractors against quantum storage
• Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes

Cited in

(11)

• Controlled alternate quantum walk-based block hash function
• Cryptographic hash functions from sequences of lifted Paley graphs
• Quantum hashing via \(\varepsilon \)-universal hashing constructions and Freivalds' fingerprinting schemas
• Attacking quantum hashing. Protocols and their cryptanalysis
• Constructing quantum hash functions based on quantum walks on Johnson graphs
• Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions
• Usefulness of decoherence in quantum-walk-based hash function
• Keyed hash function from large girth expander graphs
• Quantum hardcore functions by complexity-theoretical quantum list decoding
• Cryptographic properties of the quantum hashing based on expander graphs
• Dual Universality of Hash Functions and Its Applications to Quantum Cryptography

This page was built for publication: From graphs to keyed quantum hash functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361672)