More Web Proxy on the site http://driver.im/

research-article

Open access

Client-server Identification Protocols with Quantum PUF

Authors:

Mahshid Delavar,

Elham KashefiAuthors Info & Claims

ACM Transactions on Quantum Computing, Volume 2, Issue 3

Article No.: 12, Pages 1 - 40

https://doi.org/10.1145/3484197

Published: 30 September 2021 Publication History

All formats PDF

Abstract

Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol between a low-resource and a high-resource party to provide secure communication. In this work, we propose two identification protocols based on the emerging hardware-secure solutions, the quantum Physical Unclonable Functions (qPUFs). The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice versa. Unlike existing identification protocols based on Quantum Read-out PUFs that rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties. We provide a comprehensive comparison between the two proposed protocols in terms of resources such as quantum memory and computing ability required in both parties as well as the communication overhead between them.

References

[1]

2019. Quantum protocol zoo. Retrieved from https://wiki.veriqloud.fr.

[2]

Gorjan Alagic and Christian Majenz. 2017. Quantum non-malleability and authentication. In Annual International Cryptology Conference. Springer, 310–341.

[3]

Gorjan Alagic, Christian Majenz, and Alexander Russell. 2020. Efficient simulation of random states and random unitaries. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 759–787.

[4]

Myrto Arapinis, Mahshid Delavar, Mina Doosti, and Elham Kashefi. 2021. Quantum physical unclonable functions: Possibilities and impossibilities. Quantum 5 (2021), 475.

[5]

Frederik Armknecht, Daisuke Moriyama, Ahmad-Reza Sadeghi, and Moti Yung. 2016. Towards a unified security model for physically unclonable functions. In Cryptographers’ Track at the RSA Conference. Springer, 271–287.

Digital Library

[6]

Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G. S. L. Brandao, David A. Buell et al. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574, 7779 (2019), 505–510.

[7]

Adriano Barenco, Andre Berthiaume, David Deutsch, Artur Ekert, Richard Jozsa, and Chiara Macchiavello. 1997. Stabilization of quantum computations by symmetrization. SIAM J. Comput. 26, 5 (1997), 1541–1557.

Digital Library

[8]

Ville Bergholm, Josh Izaac, Maria Schuld, Christian Gogolin, M. Sohaib Alam, Shahnawaz Ahmed, Juan Miguel Arrazola, Carsten Blank, Alain Delgado, Soran Jahangiri et al. 2018. Pennylane: Automatic differentiation of hybrid quantum-classical computations. arXiv preprint arXiv:1811.04968 (2018).

[9]

Sergey Blinov, B. Wu, and C. Monroe. 2021. Comparison of cloud-based ion trap and superconducting quantum computer architectures. arXiv preprint arXiv:2102.00371 (2021).

[10]

Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, and Mark Zhandry. 2011. Random oracles in a quantum world. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 41–69.

Digital Library

[11]

Dan Boneh and Mark Zhandry. 2013. Quantum-secure message authentication codes. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 592–608.

[12]

Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi. 2009. Universal blind quantum computation. In 50th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 517–526.

Digital Library

[13]

Anne Broadbent and Christian Schaffner. 2016. Quantum cryptography beyond quantum key distribution. Des., Codes Cryptog. 78, 1 (2016), 351–382.

Digital Library

[14]

Harry Buhrman, Richard Cleve, Serge Massar, and Ronald De Wolf. 2010. Nonlocality and communication complexity. Rev. Mod. Phys. 82, 1 (2010), 665.

[15]

Harry Buhrman, Richard Cleve, John Watrous, and Ronald De Wolf. 2001. Quantum fingerprinting. Phys. Rev. Lett. 87, 16 (2001), 167902.

[16]

Ulysse Chabaud, Eleni Diamanti, Damian Markham, Elham Kashefi, and Antoine Joux. 2018. Optimal quantum-programmable projective measurement with linear optics. Phys. Rev. A 98, 6 (2018), 062318.

[17]

Rigetti Computing. 2019. Pyquil documentation. Retrieved from http://pyquil.readthedocs.io/en/latest., 64–65.

[18]

Andrew Cross. 2018. The IBM Q experience and QISKit open-source quantum computing software. In APS March Meeting Abstracts, Vol. 2018. L58–003.

[19]

Mahshid Delavar, Sattar Mirzakuchaki, Mohammad Hassan Ameri, and Javad Mohajeri. 2017. PUF-based solutions for secure communications in advanced metering infrastructure (AMI). Int. J. Commun. Syst. 30, 9 (2017), e3195.

[20]

Jeroen Delvaux. 2017. ************Security Analysis of PUF-based Key Generation and Entity Authentication*******.Ph.D. Dissertation. Shanghai Jiao Tong University.

[21]

Eleni Diamanti. 2019. Demonstrating quantum advantage in security and efficiency with practical photonic systems. In 21st International Conference on Transparent Optical Networks (ICTON). IEEE, 1–2.

[22]

Yfke Dulek, Alex B. Grilo, Stacey Jeffery, Christian Majenz, and Christian Schaffner. 2019. Secure multi-party quantum computation with a dishonest majority. arXiv preprint arXiv:1909.13770 (2019).

[23]

Joseph F. Fitzsimons. 2017. Private quantum computation: An introduction to blind quantum computing and related protocols. npj Quant. Inf. 3, 1 (2017), 1–11.

[24]

Lukas Fladung, Georgios M. Nikolopoulos, Gernot Alber, and Marc Fischlin. 2019. Intercept-resend emulation attacks against a continuous-variable quantum authentication protocol with physical unclonable keys. Cryptography 3, 4 (2019), 25.

[25]

Fatemeh Ganji, Shahin Tajik, Fabian Fäßler, and Jean-Pierre Seifert. 2016. Strong machine learning attack against PUFs with no mathematical model. In International Conference on Cryptographic Hardware and Embedded Systems. Springer, 391–411.

Digital Library

[26]

Blaise Gassend, Dwaine Clarke, Marten Van Dijk, and Srinivas Devadas. 2002. Silicon physical random functions. In 9th ACM Conference on Computer and Communications Security. ACM, 148–160.

Digital Library

[27]

Giulio Gianfelici, Hermann Kampermann, and Dagmar Bruß. 2020. Theoretical framework for physical unclonable functions, including quantum readout. Phys. Rev. A 101, 4 (2020), 042337.

[28]

Sebastianus A. Goorden, Marcel Horstmann, Allard P. Mosk, Boris Škorić, and Pepijn W. H. Pinkse. 2014. Quantum-secure authentication of a physical unclonable key. Optica 1, 6 (2014), 421–424.

[29]

Jorge Guajardo, Sandeep S. Kumar, Geert-Jan Schrijen, and Pim Tuyls. 2007. FPGA intrinsic PUFs and their use for IP protection. In International Workshop on Cryptographic Hardware and Embedded Systems. Springer, 63–80.

Digital Library

[30]

Charles Herder, Meng-Day Yu, Farinaz Koushanfar, and Srinivas Devadas. 2014. Physical unclonable functions and applications: A tutorial. Proc. IEEE 102, 8 (2014), 1126–1141.

[31]

Alexander Semenovich Holevo. 1973. Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii 9, 3 (1973), 3–11.

[32]

Min-Sung Kang, Jino Heo, Chang-Ho Hong, Hyung-Jin Yang, Sang-Wook Han, and Sung Moon. 2018. Controlled mutual quantum entity authentication with an untrusted third party. Quant. Inf. Proc. 17, 7 (2018), 159.

Digital Library

[33]

Mahmoud Khalafalla and Catherine Gebotys. 2019. PUFs deep attacks: Enhanced modeling attacks using deep learning techniques to break the security of double arbiter PUFs. In Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 204–209.

[34]

Hirotada Kobayashi, Keiji Matsumoto, and Tomoyuki Yamakami. 2003. Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur? In International Symposium on Algorithms and Computation. Springer, 189–198.

[35]

Niraj Kumar. 2019. Practically feasible robust quantum money with classical verification. Cryptography 3, 4 (2019), 26.

[36]

Niraj Kumar, Eleni Diamanti, and Iordanis Kerenidis. 2017. Efficient quantum communications with coherent state fingerprints over multiple channels. Phys. Rev. A 95, 3 (2017), 032337.

[37]

Alexander I. Lvovsky, Barry C. Sanders, and Wolfgang Tittel. 2009. Optical quantum memory. Nat. Photon. 3, 12 (2009), 706.

[38]

Ashley Montanaro and Ronald de Wolf. 2013. A survey of quantum property testing. arXiv preprint arXiv:1310.2035 (2013).

[39]

Michele Mosca. 2018. Cybersecurity in an era with quantum computers: Will we be ready?IEEE Secur. Priv. 16, 5 (2018), 38–41.

Digital Library

[40]

Georgios M. Nikolopoulos. 2018. Continuous-variable quantum authentication of physical unclonable keys: Security against an emulation attack. Phys. Rev. A 97, 1 (2018), 012324.

[41]

Georgios M. Nikolopoulos and Eleni Diamanti. 2017. Continuous-variable quantum authentication of physical unclonable keys. Sci. Rep. 7 (2017), 46047.

[42]

Ravikanth Pappu, Ben Recht, Jason Taylor, and Neil Gershenfeld. 2002. Physical one-way functions. Science 297, 5589 (2002), 2026–2030.

Digital Library

[43]

S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, Tobias Gehring, C. Lupo, C. Ottaviani et al. 2019. Advances in quantum cryptography. arXiv preprint arXiv:1906.01645 (2019).

[44]

Ulrich Rührmair and Daniel E. Holcomb. 2014. PUFs at a glance. In Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1–6.

Digital Library

[45]

Ulrich Rührmair, Frank Sehnke, Jan Sölter, Gideon Dror, Srinivas Devadas, and Jürgen Schmidhuber. 2010. Modeling attacks on physical unclonable functions. In 17th ACM Conference on Computer and Communications Security. 237–249.

Digital Library

[46]

Boris Škorić. 2010. Quantum readout of physical unclonable functions. In International Conference on Cryptology in Africa. Springer, 369–386.

Digital Library

[47]

Boris Škorić. 2012. Quantum readout of physical unclonable functions. Int. J. Quant. Inf. 10, 01 (2012), 1250001.

[48]

Boris Škoric. 2016. Security analysis of quantum-readout PUFs in the case of challenge-estimation attacks. Quant. Inf. Comput. 16 (2016).

Digital Library

[49]

Fang Song. 2014. A note on quantum security for post-quantum cryptography. In International Workshop on Post-quantum Cryptography. Springer, 246–265.

[50]

G. Edward Suh and Srinivas Devadas. 2007. Physical unclonable functions for device authentication and secret key generation. In 44th ACM/IEEE Design Automation Conference. IEEE, 9–14.

Digital Library

[51]

Dominique Unruh. 2013. Everlasting multi-party computation. In Annual Cryptology Conference. Springer, 380–397.

[52]

Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press.

Digital Library

[53]

John Watrous. 2003. On the complexity of simulating space-bounded quantum computations. Comput. Complex. 12, 1–2 (2003), 48–84.

Digital Library

[54]

Stephanie Wehner, David Elkouss, and Ronald Hanson. 2018. Quantum internet: A vision for the road ahead. Science 362, 6412 (2018), eaam9288.

[55]

William K. Wootters and Wojciech H. Zurek. 1982. A single quantum cannot be cloned. Nature 299, 5886 (1982), 802–803.

[56]

Feihu Xu, Juan Miguel Arrazola, Kejin Wei, Wenyuan Wang, Pablo Palacios-Avila, Chen Feng, Shihan Sajeed, Norbert Lütkenhaus, and Hoi-Kwong Lo. 2015. Experimental quantum fingerprinting with weak coherent pulses. Nat. Commun. 6, 1 (2015), 1–9.

[57]

Yao Yao, Ming Gao, Mo Li, and Jian Zhang. 2016. Quantum cloning attacks against PUF-based quantum authentication systems. Quant. Inf. Proc. 15, 8 (2016), 3311–3325.

Digital Library

[58]

Robert Young, Utz Roedig, and Jonathan Roberts. 2019. Quantum physical unclonable function. US Patent App. 16/178,670.

Cited By

Nilesh KDeppe CBoche H(2024)Quantum PUF and its Applications with Information Theoretic Analysis2024 IEEE 10th World Forum on Internet of Things (WF-IoT)10.1109/WF-IoT62078.2024.10811185(1-6)Online publication date: 10-Nov-2024
https://doi.org/10.1109/WF-IoT62078.2024.10811185
Cirillo FEsposito C(2024)Practical Evaluation of a Quantum Physical Unclonable Function and Design of an Authentication Scheme2024 IEEE International Conference on Quantum Computing and Engineering (QCE)10.1109/QCE60285.2024.00161(1354-1363)Online publication date: 15-Sep-2024
https://doi.org/10.1109/QCE60285.2024.00161
Khan MAman MSikdar B(2024)Soteria: A Quantum-Based Device Attestation Technique for Internet of ThingsIEEE Internet of Things Journal10.1109/JIOT.2023.334639711:9(15320-15333)Online publication date: 1-May-2024
https://doi.org/10.1109/JIOT.2023.3346397
Show More Cited By

Index Terms

Client-server Identification Protocols with Quantum PUF

Recommendations

Collusive attacks to "circle-type" multi-party quantum key agreement protocols

We find that existing multi-party quantum key agreement (MQKA) protocols designed for fairness of the key are, in fact, unfair. Our analysis shows that these protocols are sensitive to collusive attacks; that is, dishonest participants can collaborate ...
Semi-quantum identification
Abstract
To ensure communication security, it is necessary to verify the identities of the communicators. Two semi-quantum identification protocols with single photons involving two parties, i.e., quantum Alice and classical Bob, are presented. In the ...
Protocols of quantum key agreement solely using Bell states and Bell measurement

Two protocols of quantum key agreement (QKA) that solely use Bell state and Bell measurement are proposed. The first protocol of QKA proposed here is designed for two-party QKA, whereas the second protocol is designed for multi-party QKA. The proposed ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Quantum Computing

ACM Transactions on Quantum Computing Volume 2, Issue 3

September 2021

134 pages

EISSN:2643-6817

DOI:10.1145/3481707

Editors:
Travis S. Humble
Oak Ridge National Laboratory, USA
,
Mingsheng Ying
University of Technology Sydney, Australia

Issue’s Table of Contents

Copyright © 2021 Association for Computing Machinery.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 September 2021

Accepted: 01 August 2021

Revised: 01 August 2021

Received: 01 September 2020

Published in TQC Volume 2, Issue 3

Check for updates

Author Tags

Qualifiers

Research-article
Refereed

Funding Sources

European Unions Horizon 2020 Research and Innovation Programme
UK Engineering and Physical Sciences Research Council

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
827
Total Downloads

Downloads (Last 12 months)270
Downloads (Last 6 weeks)39

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Nilesh KDeppe CBoche H(2024)Quantum PUF and its Applications with Information Theoretic Analysis2024 IEEE 10th World Forum on Internet of Things (WF-IoT)10.1109/WF-IoT62078.2024.10811185(1-6)Online publication date: 10-Nov-2024
https://doi.org/10.1109/WF-IoT62078.2024.10811185
Cirillo FEsposito C(2024)Practical Evaluation of a Quantum Physical Unclonable Function and Design of an Authentication Scheme2024 IEEE International Conference on Quantum Computing and Engineering (QCE)10.1109/QCE60285.2024.00161(1354-1363)Online publication date: 15-Sep-2024
https://doi.org/10.1109/QCE60285.2024.00161
Khan MAman MSikdar B(2024)Soteria: A Quantum-Based Device Attestation Technique for Internet of ThingsIEEE Internet of Things Journal10.1109/JIOT.2023.334639711:9(15320-15333)Online publication date: 1-May-2024
https://doi.org/10.1109/JIOT.2023.3346397
Nilesh KDeppe CBoche H(2024)Information Theoretic Analysis of a Quantum PUF2024 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT57864.2024.10619408(3320-3325)Online publication date: 7-Jul-2024
https://doi.org/10.1109/ISIT57864.2024.10619408
Ghosh SGaletsky VJuliá Farré PDeppe CFerrara RBoche H(2024)Existential unforgeability in quantum authentication from quantum physical unclonable functions based on random von Neumann measurementPhysical Review Research10.1103/PhysRevResearch.6.0433066:4Online publication date: 23-Dec-2024
https://doi.org/10.1103/PhysRevResearch.6.043306
Li Calsi DKohl PChoi JNötzel J(2024)The impact of message losses and retransmissions on quantum cryptographic protocolsComputer Networks10.1016/j.comnet.2024.110735(110735)Online publication date: Aug-2024
https://doi.org/10.1016/j.comnet.2024.110735
Li Calsi DKohl P(2024)Comment on “quantum identity authentication with single photon”Quantum Information Processing10.1007/s11128-024-04564-x23:10Online publication date: 19-Oct-2024
https://doi.org/10.1007/s11128-024-04564-x
Takaoğlu FTakaoğlu MDursun TBağcı T(2024)Novel Quantum Key Distribution Method Based on Blockchain TechnologyEmerging Trends and Applications in Artificial Intelligence10.1007/978-3-031-56728-5_22(251-263)Online publication date: 30-Apr-2024
https://doi.org/10.1007/978-3-031-56728-5_22
Bathalapalli VMohanty SPan CKougianos E(2023)QPUF: Quantum Physical Unclonable Functions for Security-by-Design of Industrial Internet-of-Things2023 IEEE International Symposium on Smart Electronic Systems (iSES)10.1109/iSES58672.2023.00067(296-301)Online publication date: 18-Dec-2023
https://doi.org/10.1109/iSES58672.2023.00067
Smith KViszlai JSeifert LBaker JSzefer JChong F(2023)Fast Fingerprinting of Cloud-based NISQ Quantum Computers2023 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)10.1109/HOST55118.2023.10133778(1-12)Online publication date: 1-May-2023
https://doi.org/10.1109/HOST55118.2023.10133778
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents