{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T14:44:57Z","timestamp":1751035497804,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T00:00:00Z","timestamp":1693267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,29]]},"DOI":"10.1145\/3600160.3604982","type":"proceedings-article","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T22:54:41Z","timestamp":1691621681000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Confidential Quantum Computing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1146-5877","authenticated-orcid":false,"given":"Barbora","family":"Hrd\u00e1","sequence":"first","affiliation":[{"name":"Fraunhofer AISEC, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9063-8416","authenticated-orcid":false,"given":"Sascha","family":"Wessel","sequence":"additional","affiliation":[{"name":"Fraunhofer AISEC, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Dorit Aharonov Michael Ben-Or Elad Eban and Urmila Mahadev. 2017. Interactive Proofs for Quantum Computations. (2017). https:\/\/doi.org\/10.48550\/arXiv.1704.04487","DOI":"10.48550\/arXiv.1704.04487"},{"volume-title":"Retrieved","year":"2022","key":"e_1_3_2_1_2_1","unstructured":"Amazon. 2022. Amazon Braket. Retrieved May 16, 2022 from https:\/\/aws.amazon.com\/braket\/"},{"key":"e_1_3_2_1_3_1","volume-title":"Retrieved","author":"AQT.","year":"2022","unstructured":"AQT. 2022. Alpine Quantum Technologies \u2013 Systems. Retrieved May 16, 2022 from https:\/\/www.aqt.eu\/qc-systems\/"},{"key":"e_1_3_2_1_4_1","unstructured":"Frederik Armknecht Colin Boyd Christopher Carr Kristian Gj\u00f6steen Angela J\u00e4schke Christian\u00a0A. Reuter and Martin Strand. 2015. A Guide to Fully Homomorphic Encryption. In Cryptology ePrint Archive Vol.\u00a02015\/1192. https:\/\/ia.cr\/2015\/1192"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Pablo Arrighi and Louis Salvail. 2006. Blind Quantum Computation. In International Journal of Quantum Information Vol.\u00a04. 883\u2013898. https:\/\/doi.org\/10.1142\/S0219749906002171","DOI":"10.1142\/S0219749906002171"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Stefanie Barz Joseph\u00a0F. Fitzsimons Elham Kashefi and Philip Walther. 2013. Experimental Verification of Quantum Computation. In Nature Physics Vol.\u00a09. 727\u2013731. https:\/\/doi.org\/10.1038\/nphys2763","DOI":"10.1038\/nphys2763"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Stefanie Barz Elham Kashefi Anne Broadbent Joseph\u00a0F. Fitzsimons Anton Zeilinger and Philip Walther. 2012. Demonstration of Blind Quantum Computing. In Science Vol.\u00a0335. 303\u2013308. https:\/\/doi.org\/10.1126\/science.1214707","DOI":"10.1126\/science.1214707"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Keith\u00a0A. Britt and Travis\u00a0S. Humble. 2017. High-Performance Computing with Quantum Processing Units. In ACM Journal on Emerging Technologies in Computing Systems Vol.\u00a013. ACM 1\u201313. https:\/\/doi.org\/10.1145\/3007651","DOI":"10.1145\/3007651"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.36"},{"key":"e_1_3_2_1_10_1","volume-title":"Quantum Information & Computation, Vol.\u00a05I","author":"Childs M.","year":"2011","unstructured":"Andrew\u00a0M. Childs. 2005. Secure Assisted Quantum Computation. In Quantum Information & Computation, Vol.\u00a05I. Rinton Press, Paramus, NJ, 456\u2013466. https:\/\/doi.org\/0.5555\/2011670.2011674"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1904.06303"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Alexandru Cojocaru L\u00e9o Colisson Elham Kashefi and Petros Wallden. 2021. On the Possibility of Classical Client Blind Quantum Computing. In Cryptography Vol.\u00a05. MDPI. https:\/\/doi.org\/10.3390\/cryptography5010003","DOI":"10.3390\/cryptography5010003"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/tqe.2021.3053921"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Mark Fingerhuth Tom\u00e1\u0161 Babej and Peter Wittek. 2018. Open Source Software in Quantum Computing. In PLOS ONE Vol.\u00a013. Plos United Kingdom. https:\/\/doi.org\/10.1371\/journal.pone.0208561","DOI":"10.1371\/journal.pone.0208561"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Joseph\u00a0F. Fitzsimons. 2017. Private Quantum Computation: An Introduction to Blind Quantum Computing and Related Protocols.. In Quantum Information Vol.\u00a03. 1\u201311. https:\/\/doi.org\/10.1038\/s41534-017-0025-3","DOI":"10.1038\/s41534-017-0025-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.012303"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1155\/2007"},{"key":"e_1_3_2_1_18_1","unstructured":"Michele Grossi Luca Crippa Antonello Aita Giacomo Bartoli Vito Sammarco Eleonora Picca Najla Said Filippo Tramonto and Federico Mattei. 2021. A Serverless Cloud Integration for Quantum Computing. arxiv:2107.02007"},{"key":"e_1_3_2_1_19_1","volume-title":"A Software Methodology for Compiling Quantum Programs. Quantum Sci. Technology 3","author":"H\u00e4ner Thomas","year":"2018","unstructured":"Thomas H\u00e4ner, Damian\u00a0S. Steiger, Krysta\u00a0M. Svore, and Matthias Troyer. 2018. A Software Methodology for Compiling Quantum Programs. Quantum Sci. Technology 3 (2018). arxiv:1604.01401"},{"volume-title":"Quantum Science and Technology, Vol.\u00a04","author":"Heyfron E.","key":"e_1_3_2_1_20_1","unstructured":"Luke\u00a0E. Heyfron and Earl\u00a0T. Campbell. 2018. An Efficient Quantum Compiler that Reduces T Count. In Quantum Science and Technology, Vol.\u00a04. IOP Publishing Ltd."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"He-Liang Huang Qi Zhao Xiongfeng Ma Chang Liu Zu-En Su Xi-Lin Wang Li Li Nai-Le Liu Barry\u00a0C. Sanders Chao-Yang Lu and Jian-Wei Pan. 2017. Experimental Blind Quantum Computing for a Classical Client. (2017).","DOI":"10.1103\/PhysRevLett.119.050503"},{"key":"e_1_3_2_1_22_1","volume-title":"Retrieved","author":"IBM.","year":"2022","unstructured":"IBM. 2022. IBM Qiskit SDK. Retrieved May 16, 2022 from https:\/\/qiskit.org\/"},{"key":"e_1_3_2_1_23_1","volume-title":"Retrieved","author":"IBM.","year":"2022","unstructured":"IBM. 2022. IBM Quantum - Fair-share Queuing. Retrieved May 30, 2022 from https:\/\/quantum-computing.ibm.com\/lab\/docs\/iql\/manage\/systems\/queue\/"},{"key":"e_1_3_2_1_24_1","volume-title":"Retrieved","author":"IBM.","year":"2022","unstructured":"IBM. 2022. IBM Quantum End User Agreement \u2013 Effective Date: Jun 19, 2020 10:30 AM. Retrieved May 30, 2022 from https:\/\/quantum-computing.ibm.com\/terms"},{"key":"e_1_3_2_1_25_1","volume-title":"Retrieved","author":"IBM.","year":"2022","unstructured":"IBM. 2022. IBM Quantum Lab \u2013 Simulators Overview. Retrieved September 16, 2022 from https:\/\/quantum-computing.ibm.com\/lab\/docs\/iql\/manage\/simulator\/"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Maryam Karimi-Mamaghan Mehrdad Mohammadi Patrick Meyer Amir\u00a0M. Karimi-Mamaghan and El-Ghazali Talbi. 2022. Machine Learning at the Service of Meta-Heuristics for Solving Combinatorial Optimization Problems: A State-of-the-Art.. In European Journal of Operational Research Vol.\u00a0296. 393\u2013422. https:\/\/doi.org\/10.1016\/j.ejor.2021.04.032","DOI":"10.1016\/j.ejor.2021.04.032"},{"key":"e_1_3_2_1_27_1","volume-title":"Classical Homomorphic Encryption for Quantum Circuits. In 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 332\u2013338","author":"Mahadev Urmila","year":"2018","unstructured":"Urmila Mahadev. 2018. Classical Homomorphic Encryption for Quantum Circuits. In 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 332\u2013338."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.7.031004"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1038\/npjqi.2015.23"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322273"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.042334"},{"key":"e_1_3_2_1_32_1","volume-title":"Retrieved","author":"Q.","year":"2022","unstructured":"ProjectQ. 2022. ProjectQ Documentation \u2013 Simulator. Retrieved September 16, 2022 from https:\/\/projectq.readthedocs.io\/en\/latest\/_doc_gen\/projectq.backends.html#projectq.backends.Simulator"},{"volume-title":"Retrieved","year":"2022","key":"e_1_3_2_1_33_1","unstructured":"Quantiki. 2022. Quantiki \u2013 Quantum Information Portal and Wiki. Retrieved May 30, 2022 from https:\/\/quantiki.org\/wiki\/list-qc-simulators"},{"key":"e_1_3_2_1_34_1","volume-title":"Retrieved","author":"Quantum Cambrigde","year":"2022","unstructured":"Cambrigde Quantum. 2022. Cambrigde Quantum \u2013 Quantum Origin. Retrieved May 16, 2022 from https:\/\/cambridgequantum.com\/our-technology\/origin\/"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Ben\u00a0W. Reichardt Falk Unger and Umesh Vazirani. 2012. A Classical Leash for a Quantum System: Command of Quantum Systems via Rigidity of CHSH Games. arxiv:1209.0448","DOI":"10.1145\/2422436.2422473"},{"volume-title":"Retrieved","year":"2022","key":"e_1_3_2_1_36_1","unstructured":"Rigetti. 2022. Rigetti Forest. Retrieved May 16, 2022 from https:\/\/pyquil-docs.rigetti.com\/en\/v2.7.2\/"},{"key":"e_1_3_2_1_37_1","unstructured":"Ronald\u00a0L. Rivest Len Adleman and Michael\u00a0L. Dertouzos. 1978. On Data Banks and Privacy Homomorphisms. In Foundations of Secure Computation Vol.\u00a04. 169\u2013180."},{"key":"e_1_3_2_1_38_1","unstructured":"Balwinder Sodhi. 2018. Quality Attributes on Quantum Computing Platforms.arxiv:1803.07407"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","unstructured":"Damian\u00a0S. Steiger Thomas H\u00e4ner and Matthias Troyer. 2018. ProjectQ: An Open Source Software Framework for Quantum Computing. https:\/\/doi.org\/10.22331\/q-2018-01-31-49","DOI":"10.22331\/q-2018-01-31-49"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","unstructured":"Si-Hui Tan Joshua\u00a0A. Kettlewell Yingkai Ouyang Lin Chen and Joseph\u00a0F. Fitzsimons. 2016. A Quantum Approach to Homomorphic Encryption. In Scientific Reports 6 Vol.\u00a033467. https:\/\/doi.org\/10.1038\/srep33467","DOI":"10.1038\/srep33467"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Hai-Ru Xu and Bang-Hai Wang. 2021. Universal Single-server Blind Quantum Computation for Classical Clients. In Laser Physics Letters Vol.\u00a019. 015202.","DOI":"10.1088\/1612-202X\/ac3a0d"},{"key":"e_1_3_2_1_42_1","volume-title":"Retrieved","author":"Zoo Complexity","year":"2022","unstructured":"Complexity Zoo. 2022. Complexity Zoo. Retrieved May 30, 2022 from https:\/\/complexityzoo.net\/"},{"key":"e_1_3_2_1_43_1","volume-title":"Retrieved","author":"Zoo Quantum\u00a0Algorithm","year":"2022","unstructured":"Quantum\u00a0Algorithm Zoo. 2022. Quantum Algorithm Zoo. Retrieved May 30, 2022 from https:\/\/quantumalgorithmzoo.org\/"}],"event":{"name":"ARES 2023: The 18th International Conference on Availability, Reliability and Security","acronym":"ARES 2023","location":"Benevento Italy"},"container-title":["Proceedings of the 18th International Conference on Availability, Reliability and Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3600160.3604982","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3600160.3604982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:13Z","timestamp":1750178173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3600160.3604982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,29]]},"references-count":43,"alternative-id":["10.1145\/3600160.3604982","10.1145\/3600160"],"URL":"https:\/\/doi.org\/10.1145\/3600160.3604982","relation":{},"subject":[],"published":{"date-parts":[[2023,8,29]]},"assertion":[{"value":"2023-08-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}