Quantum Cursed Fingerprinting (QCF) A Technique to embed Zero-Knowledge Proof in Quantum Fingerprinting technique

Main Article Content

Article Sidebar

Published Sep 11, 2021


Quantum communication has shown astonishingly fast development taking the advantage of quantum computation power that is being developed by technology giants like IBM, Google. The security issues and communication gaps caused by these quantum computers must be curled by the quantum computing methods. There are situations where the security of data is of less concern than knowing the fact “whether the data is tempered or not”. The Fingerprinting technique provides such knowledge by creating fingerprints of such important data and keeping the record of the temperament of data. Quantum Fingerprinting (QF) follows a procedure of creation of fingerprints of data and uses a referee which tells whether the fingerprint strings match or not. In a dilemmatic situation of fingerprinting, compromising either with security or speed, the paper focuses on achieving the removal of the referee and adding some security. This paper uses the power of Zero-Knowledge Proof (ZKP) to improve security as well as removes the use of referees in QF. The Zero Knowledge Proof is a protocol by which one party can prove to another party that they know the value “X”, without conveying any information apart from the fact that they are deemed to know “X”. Thus, embedding the curse of Zero-Knowledge Protocol to quantum fingerprinting gives Quantum Cursed Fingerprinting (QCF) the power of security and removal of the referee to match the fingerprints.


How to Cite

SHARMA, P. (2021). Quantum Cursed Fingerprinting (QCF): A Technique to embed Zero-Knowledge Proof in Quantum Fingerprinting technique. SPAST Abstracts, 1(01). Retrieved from https://spast.org/techrep/article/view/274
Abstract 2 |

Article Details


Quantum Fingerprinting Zero Knowledge Proof, Quantum Communication, Cryptography

M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
I. Kremer. Quantum communication. Master's thesis, Hebrew University, Computer Science Department, 1995.
H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16), September 26, 2001. quant-ph/0102001.
A. C-C. Yao. Some complexity questions related to distributive computing. In Proceedings of 11th ACM STOC, pages 209–213, 1979.
E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
A. C-C. Yao. On the power of quantum fingerprinting. In Proceedings of 35th ACM STOC, pages 77–81, 2003.
A. Golinsky and P. Sen. A note on the power of quantum fingerprinting, quant-ph/0510091, December 2003.
M. Furer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos, “On Completeness and Soundness in Interactive Proof Systems”, Advances in Computing Research: a research annual, Vol. 5 (S. Micali, ed.), pp. 429–442, 1989.
U. Feige, A. Fiat, and A. Shamir, Zero-Knowledge Proofs of Identity, Proc. 19th ACM Symp. on Theory of Computing (1987), pp. 210–217.
Shafi Goldwasser, Silvio Micali, and Charles Rackoff, “The Knowledge Complexity of Interactive Proof Systems”, SIAM Journal of Computing, 18(1), 186–208. (23 pages),2006.
Chalkias, Konstantinos. "https://www.linkedin.com/pulse/demonstrate-how-zero-knowledge-proofs-work-without-using-chalkias". Corda Con 2017. Retrieved 2017-09-13.
GE3- Computers & Information Technology