An Attack on Zawadzki’s Quantum Authentication Scheme
Identification schemes are interactive cryptographic protocols typically involving two parties, a prover, who wants to provide evidence of their identity and a verifier, who checks the provided evidence and decides whether or not it comes from the intended prover. Given the growing interest in quant...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-03-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/23/4/389 |
id |
doaj-f3dfcae1e557458bb7c5ec0ebd55f281 |
---|---|
record_format |
Article |
spelling |
doaj-f3dfcae1e557458bb7c5ec0ebd55f2812021-03-26T00:01:28ZengMDPI AGEntropy1099-43002021-03-012338938910.3390/e23040389An Attack on Zawadzki’s Quantum Authentication SchemeCarlos E. González-Guillén0María Isabel González Vasco1Floyd Johnson2Ángel L. Pérez del Pozo3Departamento de Matemática Aplicada a la Ingeniería Industrial, Universidad Politécnica de Madrid, 28040 Madrid, SpainMACIMTE, Universidad Rey Juan Carlos, 28933 Madrid, SpainDepartment of Mathmatical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USAMACIMTE, Universidad Rey Juan Carlos, 28933 Madrid, SpainIdentification schemes are interactive cryptographic protocols typically involving two parties, a prover, who wants to provide evidence of their identity and a verifier, who checks the provided evidence and decides whether or not it comes from the intended prover. Given the growing interest in quantum computation, it is indeed desirable to have explicit designs for achieving user identification through quantum resources. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki. We discuss the applicability of the theoretical impossibility results from Lo, Colbeck and Buhrman et al. and formally prove that the protocol must necessarily be insecure. Moreover, to better illustrate our insecurity claim, we present an attack on Zawadzki’s protocol and show that by using a simple strategy an adversary may indeed obtain relevant information on the shared identification secret. Specifically, through the use of the principal of conclusive exclusion on quantum measurements, our attack geometrically reduces the key space resulting in the claimed logarithmic security being reduced effectively by a factor of two after only three verification attempts.https://www.mdpi.com/1099-4300/23/4/389quantum identity authenticationprivate equality testsconclusive exclusion |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Carlos E. González-Guillén María Isabel González Vasco Floyd Johnson Ángel L. Pérez del Pozo |
spellingShingle |
Carlos E. González-Guillén María Isabel González Vasco Floyd Johnson Ángel L. Pérez del Pozo An Attack on Zawadzki’s Quantum Authentication Scheme Entropy quantum identity authentication private equality tests conclusive exclusion |
author_facet |
Carlos E. González-Guillén María Isabel González Vasco Floyd Johnson Ángel L. Pérez del Pozo |
author_sort |
Carlos E. González-Guillén |
title |
An Attack on Zawadzki’s Quantum Authentication Scheme |
title_short |
An Attack on Zawadzki’s Quantum Authentication Scheme |
title_full |
An Attack on Zawadzki’s Quantum Authentication Scheme |
title_fullStr |
An Attack on Zawadzki’s Quantum Authentication Scheme |
title_full_unstemmed |
An Attack on Zawadzki’s Quantum Authentication Scheme |
title_sort |
attack on zawadzki’s quantum authentication scheme |
publisher |
MDPI AG |
series |
Entropy |
issn |
1099-4300 |
publishDate |
2021-03-01 |
description |
Identification schemes are interactive cryptographic protocols typically involving two parties, a prover, who wants to provide evidence of their identity and a verifier, who checks the provided evidence and decides whether or not it comes from the intended prover. Given the growing interest in quantum computation, it is indeed desirable to have explicit designs for achieving user identification through quantum resources. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki. We discuss the applicability of the theoretical impossibility results from Lo, Colbeck and Buhrman et al. and formally prove that the protocol must necessarily be insecure. Moreover, to better illustrate our insecurity claim, we present an attack on Zawadzki’s protocol and show that by using a simple strategy an adversary may indeed obtain relevant information on the shared identification secret. Specifically, through the use of the principal of conclusive exclusion on quantum measurements, our attack geometrically reduces the key space resulting in the claimed logarithmic security being reduced effectively by a factor of two after only three verification attempts. |
topic |
quantum identity authentication private equality tests conclusive exclusion |
url |
https://www.mdpi.com/1099-4300/23/4/389 |
work_keys_str_mv |
AT carlosegonzalezguillen anattackonzawadzkisquantumauthenticationscheme AT mariaisabelgonzalezvasco anattackonzawadzkisquantumauthenticationscheme AT floydjohnson anattackonzawadzkisquantumauthenticationscheme AT angellperezdelpozo anattackonzawadzkisquantumauthenticationscheme AT carlosegonzalezguillen attackonzawadzkisquantumauthenticationscheme AT mariaisabelgonzalezvasco attackonzawadzkisquantumauthenticationscheme AT floydjohnson attackonzawadzkisquantumauthenticationscheme AT angellperezdelpozo attackonzawadzkisquantumauthenticationscheme |
_version_ |
1724203259483127808 |