From graphs to keyed quantum hash functions

DOI10.1134/S1995080216060202zbMath1369.94574arXiv1606.00256MaRDI QIDQ2361672

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)

Related Items (4)

Cryptographic properties of the quantum hashing based on expander graphs ⋮ Usefulness of decoherence in quantum-walk-based hash function ⋮ Attacking quantum hashing. Protocols and their cryptanalysis ⋮ Constructing quantum hash functions based on quantum walks on Johnson graphs

Cites Work

• Unnamed Item
• Quantum hashing. Group approach
• Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
• Cryptographic hash functions from expander graphs
• Quantum hashing for finite abelian groups
• Near-optimal extractors against quantum storage
• An Introduction to Randomness Extractors
• Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
• Expander graphs and their applications
• Short seed extractors against quantum storage

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