From graphs to keyed quantum hash functions
From MaRDI portal
Publication:2361672
DOI10.1134/S1995080216060202zbMATH Open1369.94574arXiv1606.00256MaRDI QIDQ2361672FDOQ2361672
Authors: Yanyan Li 
Publication date: 30 June 2017
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1606.00256
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
Applications of graph theory (05C90) Cryptography (94A60) Structural characterization of families of graphs (05C75)
Cites Work
- Expander graphs and their applications
- Cryptographic hash functions from expander graphs
- An introduction to randomness extractors
- Title not available (Why is that?)
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Quantum hashing. Group approach
- Near-optimal extractors against quantum storage
- Quantum hashing for finite abelian groups
- Short seed extractors against quantum storage
Cited In (11)
- 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
- Usefulness of decoherence in quantum-walk-based hash function
- Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions
- 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
- Controlled alternate quantum walk-based block hash function
- Cryptographic hash functions from sequences of lifted Paley graphs
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)
