{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:54:52Z","timestamp":1787759692045,"version":"build-2784847793"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T00:00:00Z","timestamp":1632960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Unions Horizon 2020 Research and Innovation Programme","award":["820445"],"award-info":[{"award-number":["820445"]}]},{"DOI":"10.13039\/501100000266","name":"UK Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/N003829\/1"],"award-info":[{"award-number":["EP\/N003829\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2021,9,30]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3484197","type":"journal-article","created":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T17:35:15Z","timestamp":1633023315000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Client-server Identification Protocols with Quantum PUF"],"prefix":"10.1145","volume":"2","author":[{"given":"Mina","family":"Doosti","sequence":"first","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niraj","family":"Kumar","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahshid","family":"Delavar","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elham","family":"Kashefi","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, United Kingdom; CNRS, LIP6, Sorbonne Universit\u00e9, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2019. Quantum protocol zoo. Retrieved from https:\/\/wiki.veriqloud.fr.  2019. Quantum protocol zoo. Retrieved from https:\/\/wiki.veriqloud.fr."},{"key":"e_1_2_1_2_1","volume-title":"Annual International Cryptology Conference. Springer, 310\u2013341","author":"Alagic Gorjan","year":"2017","unstructured":"Gorjan Alagic and Christian Majenz . 2017 . Quantum non-malleability and authentication . In Annual International Cryptology Conference. Springer, 310\u2013341 . Gorjan Alagic and Christian Majenz. 2017. Quantum non-malleability and authentication. In Annual International Cryptology Conference. Springer, 310\u2013341."},{"key":"e_1_2_1_3_1","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 759\u2013787","author":"Alagic Gorjan","year":"2020","unstructured":"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\u2013787 . 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\u2013787."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-15-475"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_16"},{"key":"e_1_2_1_6_1","volume-title":"Buell et\u00a0al","author":"Arute Frank","year":"2019","unstructured":"Frank Arute , Kunal Arya , Ryan Babbush , Dave Bacon , Joseph\u00a0 C. Bardin , Rami Barends , Rupak Biswas , Sergio Boixo , Fernando\u00a0 G. S. L. Brandao , David\u00a0 A. Buell et\u00a0al . 2019 . Quantum supremacy using a programmable superconducting processor. Nature 574, 7779 (2019), 505\u2013510. Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph\u00a0C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando\u00a0G. S. L. Brandao, David\u00a0A. Buell et\u00a0al. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574, 7779 (2019), 505\u2013510."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302452"},{"key":"e_1_2_1_8_1","volume-title":"Soran Jahangiri et\u00a0al","author":"Bergholm Ville","year":"2018","unstructured":"Ville Bergholm , Josh Izaac , Maria Schuld , Christian Gogolin , M.\u00a0 Sohaib Alam , Shahnawaz Ahmed , Juan\u00a0Miguel Arrazola , Carsten Blank , Alain Delgado , Soran Jahangiri et\u00a0al . 2018 . Pennylane : Automatic differentiation of hybrid quantum-classical computations. arXiv preprint arXiv:1811.04968 (2018). Ville Bergholm, Josh Izaac, Maria Schuld, Christian Gogolin, M.\u00a0Sohaib Alam, Shahnawaz Ahmed, Juan\u00a0Miguel Arrazola, Carsten Blank, Alain Delgado, Soran Jahangiri et\u00a0al. 2018. Pennylane: Automatic differentiation of hybrid quantum-classical computations. arXiv preprint arXiv:1811.04968 (2018)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"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).  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).","DOI":"10.1116\/5.0058187"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"e_1_2_1_11_1","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 592\u2013608","author":"Boneh Dan","year":"2013","unstructured":"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\u2013608 . 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\u2013608."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.36"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0157-4"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.82.665"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.87.167902"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","first-page":"062318","DOI":"10.1103\/PhysRevA.98.062318","article-title":"Optimal quantum-programmable projective measurement with linear optics","volume":"98","author":"Chabaud Ulysse","year":"2018","unstructured":"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 . 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.","journal-title":"Phys. Rev. A"},{"key":"e_1_2_1_17_1","unstructured":"Rigetti Computing. 2019. Pyquil documentation. Retrieved from http:\/\/pyquil.readthedocs.io\/en\/latest. 64\u201365.  Rigetti Computing. 2019. Pyquil documentation. Retrieved from http:\/\/pyquil.readthedocs.io\/en\/latest. 64\u201365."},{"key":"e_1_2_1_18_1","volume-title":"APS March Meeting Abstracts, Vol.\u00a0","author":"Cross Andrew","year":"2018","unstructured":"Andrew Cross . 2018 . The IBM Q experience and QISKit open-source quantum computing software . In APS March Meeting Abstracts, Vol.\u00a0 2018. L58\u2013003. Andrew Cross. 2018. The IBM Q experience and QISKit open-source quantum computing software. In APS March Meeting Abstracts, Vol.\u00a0 2018. L58\u2013003."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3195"},{"key":"e_1_2_1_20_1","unstructured":"Jeroen Delvaux. 2017. ************Security Analysis of PUF-based Key Generation and Entity Authentication*******.Ph.D. Dissertation. Shanghai Jiao Tong University.  Jeroen Delvaux. 2017. ************Security Analysis of PUF-based Key Generation and Entity Authentication*******.Ph.D. Dissertation. Shanghai Jiao Tong University."},{"key":"e_1_2_1_21_1","volume-title":"21st International Conference on Transparent Optical Networks (ICTON). IEEE, 1\u20132.","author":"Diamanti Eleni","year":"2019","unstructured":"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\u20132. 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\u20132."},{"key":"e_1_2_1_22_1","volume-title":"Secure multi-party quantum computation with a dishonest majority. arXiv preprint arXiv:1909.13770","author":"Dulek Yfke","year":"2019","unstructured":"Yfke Dulek , Alex\u00a0 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 ). Yfke Dulek, Alex\u00a0B. Grilo, Stacey Jeffery, Christian Majenz, and Christian Schaffner. 2019. Secure multi-party quantum computation with a dishonest majority. arXiv preprint arXiv:1909.13770 (2019)."},{"key":"e_1_2_1_23_1","first-page":"1","article-title":"Private quantum computation: An introduction to blind quantum computing and related protocols. npj","volume":"3","author":"Fitzsimons F.","year":"2017","unstructured":"Joseph\u00a0 F. Fitzsimons . 2017 . Private quantum computation: An introduction to blind quantum computing and related protocols. npj Quant. Inf. 3 , 1 (2017), 1 \u2013 11 . Joseph\u00a0F. Fitzsimons. 2017. Private quantum computation: An introduction to blind quantum computing and related protocols. npj Quant. Inf. 3, 1 (2017), 1\u201311.","journal-title":"Quant. Inf."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.3390\/cryptography3040025","article-title":"Intercept-resend emulation attacks against a continuous-variable quantum authentication protocol with physical unclonable keys","volume":"3","author":"Fladung Lukas","year":"2019","unstructured":"Lukas Fladung , Georgios\u00a0 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 . Lukas Fladung, Georgios\u00a0M. 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.","journal-title":"Cryptography"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53140-2_19"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586132"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","first-page":"042337","DOI":"10.1103\/PhysRevA.101.042337","article-title":"Theoretical framework for physical unclonable functions, including quantum readout","volume":"101","author":"Gianfelici Giulio","year":"2020","unstructured":"Giulio Gianfelici , Hermann Kampermann , and Dagmar Bru\u00df . 2020 . Theoretical framework for physical unclonable functions, including quantum readout . Phys. Rev. A 101 , 4 (2020), 042337 . Giulio Gianfelici, Hermann Kampermann, and Dagmar Bru\u00df. 2020. Theoretical framework for physical unclonable functions, including quantum readout. Phys. Rev. A 101, 4 (2020), 042337.","journal-title":"Phys. Rev. A"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1364\/OPTICA.1.000421"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74735-2_5"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2320516"},{"key":"e_1_2_1_31_1","first-page":"3","article-title":"Bounds for the quantity of information transmitted by a quantum communication channel","volume":"9","author":"Holevo Alexander\u00a0Semenovich","year":"1973","unstructured":"Alexander\u00a0Semenovich Holevo . 1973 . Bounds for the quantity of information transmitted by a quantum communication channel . Problemy Peredachi Informatsii 9 , 3 (1973), 3 \u2013 11 . Alexander\u00a0Semenovich Holevo. 1973. Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii 9, 3 (1973), 3\u201311.","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-018-1927-5"},{"key":"e_1_2_1_33_1","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 204\u2013209","author":"Khalafalla Mahmoud","year":"2019","unstructured":"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\u2013209 . 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\u2013209."},{"key":"e_1_2_1_34_1","volume-title":"International Symposium on Algorithms and Computation. Springer, 189\u2013198","author":"Kobayashi Hirotada","year":"2003","unstructured":"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\u2013198 . 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\u2013198."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography3040026"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","first-page":"032337","DOI":"10.1103\/PhysRevA.95.032337","article-title":"Efficient quantum communications with coherent state fingerprints over multiple channels","volume":"95","author":"Kumar Niraj","year":"2017","unstructured":"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 . 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.","journal-title":"Phys. Rev. A"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphoton.2009.231"},{"key":"e_1_2_1_38_1","volume-title":"A survey of quantum property testing. arXiv preprint arXiv:1310.2035","author":"Montanaro Ashley","year":"2013","unstructured":"Ashley Montanaro and Ronald de Wolf . 2013. A survey of quantum property testing. arXiv preprint arXiv:1310.2035 ( 2013 ). Ashley Montanaro and Ronald de Wolf. 2013. A survey of quantum property testing. arXiv preprint arXiv:1310.2035 (2013)."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.3761723"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.012324"},{"key":"e_1_2_1_41_1","first-page":"46047","article-title":"Continuous-variable quantum authentication of physical unclonable keys. Sci","volume":"7","author":"Nikolopoulos M.","year":"2017","unstructured":"Georgios\u00a0 M. Nikolopoulos and Eleni Diamanti . 2017 . Continuous-variable quantum authentication of physical unclonable keys. Sci . Rep. 7 (2017), 46047 . Georgios\u00a0M. Nikolopoulos and Eleni Diamanti. 2017. Continuous-variable quantum authentication of physical unclonable keys. Sci. Rep. 7 (2017), 46047.","journal-title":"Rep."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/935173"},{"key":"e_1_2_1_43_1","volume-title":"Ottaviani et\u00a0al","author":"Pirandola S.","year":"2019","unstructured":"S. Pirandola , U. L. Andersen , L. Banchi , M. Berta , D. Bunandar , R. Colbeck , D. Englund , Tobias Gehring , C. Lupo , C. Ottaviani et\u00a0al . 2019 . Advances in quantum cryptography. arXiv preprint arXiv:1906.01645 (2019). S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, Tobias Gehring, C. Lupo, C. Ottaviani et\u00a0al. 2019. Advances in quantum cryptography. arXiv preprint arXiv:1906.01645 (2019)."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/2616606.2617098"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866335"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12678-9_22"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749912500013"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/3179320.3179324"},{"key":"e_1_2_1_49_1","volume-title":"International Workshop on Post-quantum Cryptography. Springer, 246\u2013265","author":"Song Fang","year":"2014","unstructured":"Fang Song . 2014 . A note on quantum security for post-quantum cryptography . In International Workshop on Post-quantum Cryptography. Springer, 246\u2013265 . Fang Song. 2014. A note on quantum security for post-quantum cryptography. In International Workshop on Post-quantum Cryptography. Springer, 246\u2013265."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278484"},{"key":"e_1_2_1_51_1","volume-title":"Annual Cryptology Conference. Springer, 380\u2013397","author":"Unruh Dominique","year":"2013","unstructured":"Dominique Unruh . 2013 . Everlasting multi-party computation . In Annual Cryptology Conference. Springer, 380\u2013397 . Dominique Unruh. 2013. Everlasting multi-party computation. In Annual Cryptology Conference. Springer, 380\u2013397."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-003-0177-8"},{"key":"e_1_2_1_54_1","volume-title":"Quantum internet: A vision for the road ahead. Science 362, 6412","author":"Wehner Stephanie","year":"2018","unstructured":"Stephanie Wehner , David Elkouss , and Ronald Hanson . 2018. Quantum internet: A vision for the road ahead. Science 362, 6412 ( 2018 ), eaam9288. Stephanie Wehner, David Elkouss, and Ronald Hanson. 2018. Quantum internet: A vision for the road ahead. Science 362, 6412 (2018), eaam9288."},{"key":"e_1_2_1_55_1","volume-title":"A single quantum cannot be cloned. Nature 299, 5886","author":"Wootters K.","year":"1982","unstructured":"William\u00a0 K. Wootters and Wojciech\u00a0 H. Zurek . 1982. A single quantum cannot be cloned. Nature 299, 5886 ( 1982 ), 802\u2013803. William\u00a0K. Wootters and Wojciech\u00a0H. Zurek. 1982. A single quantum cannot be cloned. Nature 299, 5886 (1982), 802\u2013803."},{"key":"e_1_2_1_56_1","first-page":"1","article-title":"Experimental quantum fingerprinting with weak coherent pulses","volume":"6","author":"Xu Feihu","year":"2015","unstructured":"Feihu Xu , Juan\u00a0Miguel Arrazola , Kejin Wei , Wenyuan Wang , Pablo Palacios-Avila , Chen Feng , Shihan Sajeed , Norbert L\u00fctkenhaus , and Hoi-Kwong Lo . 2015 . Experimental quantum fingerprinting with weak coherent pulses . Nat. Commun. 6 , 1 (2015), 1 \u2013 9 . Feihu Xu, Juan\u00a0Miguel Arrazola, Kejin Wei, Wenyuan Wang, Pablo Palacios-Avila, Chen Feng, Shihan Sajeed, Norbert L\u00fctkenhaus, and Hoi-Kwong Lo. 2015. Experimental quantum fingerprinting with weak coherent pulses. Nat. Commun. 6, 1 (2015), 1\u20139.","journal-title":"Nat. Commun."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-016-1316-x"},{"key":"e_1_2_1_58_1","first-page":"670","article-title":"Quantum physical unclonable function","volume":"16","author":"Young Robert","year":"2019","unstructured":"Robert Young , Utz Roedig , and Jonathan Roberts . 2019 . Quantum physical unclonable function . US Patent App. 16\/178 , 670 . Robert Young, Utz Roedig, and Jonathan Roberts. 2019. Quantum physical unclonable function. US Patent App. 16\/178,670.","journal-title":"US Patent App."}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484197","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3484197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:13Z","timestamp":1750191433000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,30]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9,30]]}},"alternative-id":["10.1145\/3484197"],"URL":"https:\/\/doi.org\/10.1145\/3484197","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,30]]},"assertion":[{"value":"2020-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}