Cryptographic quantum hashing

Ablayev, Farid; Vasiliev, Alexander

doi:10.1088/1612-2011/11/2/025202

Cited by 55 publications

(57 citation statements)

References 9 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The crucial procedure for quantum hashing is an equality test for |ψ(v) and |ψ(w) that can be used to compare encoded classical messages v and w; see for example (Gottesman and Chuang, 2001). This procedure can be a well-known SWAP-test (Buhrman, Cleve, Watrous, and Wolf, 2001) or something that is adapted for specific hashing function, like REVERSE-test (Ablayev and Vasiliev, 2014).…”

Section: Collision -Resistancementioning

confidence: 99%

See 1 more Smart Citation

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects

Ablayev¹,

Ablayev²,

Vasiliev³

et al. 2016

BJMC

View full text Add to dashboard Cite

Abstract. Rusins Freivalds was one of the first researchers who introduced methods (later called fingerprinting) for constructing efficient classical randomized and quantum algorithms. Fingerprinting and cryptographic hashing have quite different usages in computer science, but have similar properties. Interpretation of their properties is determined by the area of their usage: fingerprinting methods are methods for constructing efficient randomized and quantum algorithms for computational problems, while hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, while quantum fingerprinting and quantum hashing have a short history. In the paper we present computational aspects of quantum fingerprinting, discuss cryptographical properties of quantum hashing, and present the possible use of quantum hashing for quantum hash-based message authentication codes.

show abstract

Section: Collision -Resistancementioning

confidence: 99%

“…The above quantum hash function is essentially equivalent to the one we have defined earlier in (Ablayev and Vasiliev, 2014), which is in turn based on the quantum fingerprinting function from (Ablayev and Vasiliev, 2009). …”

Section: Quantum Fingerprinting Functions As Hash Functionsmentioning

confidence: 99%

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects

Ablayev¹,

Ablayev²,

Vasiliev³

et al. 2016

BJMC

View full text Add to dashboard Cite

show abstract

“…In [2] we have discussed the notion of quantum collision. The reason why we have defined it is the observation that in quantum hashing there might be no collisions in the classical sense: quantum hashes being the quantum states may store arbitrary amount of data and may be different for unequal messages.…”

Section: Preliminariesmentioning

confidence: 99%

“…Following the ideas and properties of the cryptographic hashing [1] we have proposed its quantum analogue in [2]. Just like in classical case it may find applications in different communication scenarios including single-bit quantum digital signature protocol from [3] and quantum communication protocols (e.g.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Minimizing collisions for quantum hashing

Васильев¹,

Vasiliev²,

Зиятдинов³

et al. 2016

Матем. вопр. криптогр.

View full text Add to dashboard Cite

show abstract

Full quantum one‐way function for quantum cryptography

Shang

Tang

Chen

et al. 2020

Quantum Engineering

View full text Add to dashboard Cite

Summary One‐way functions are fundamental tools for cryptography. Until now, quantum one‐way functions have several input‐output categories such as “classical‐to‐classical,” “classical‐to‐quantum,” and “quantum‐to‐classical,” which are used for postquantum cryptography or quantum cryptography. However, there are still no intrinsic “quantum‐to‐quantum” quantum one‐way functions. In this article, we propose the full quantum one‐way function to design full quantum cryptographic schemes. By concatenating the “quantum‐classical” one‐way function and the rotation operation of single qubit, the full quantum one‐way function has the input and output of quantum states. We prove its one‐way property from “easy computation” and “computationally difficult to invert.” Then we apply the full quantum one‐way function to quantum identity authentication. Security analysis shows that the proposed quantum identity authentication scheme based on the full quantum one‐way function is secure even under active attacks.

show abstract

Cryptographic quantum hashing

Cited by 55 publications

References 9 publications

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects

Minimizing collisions for quantum hashing

Full quantum one‐way function for quantum cryptography

Contact Info

Product

Resources

About