{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:08:35Z","timestamp":1772039315145,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030882372","type":"print"},{"value":"9783030882389","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88238-9_2","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T08:17:47Z","timestamp":1632903467000},"page":"24-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Constructions for Quantum Indistinguishability Obfuscation"],"prefix":"10.1007","author":[{"given":"Anne","family":"Broadbent","sequence":"first","affiliation":[]},{"given":"Raza Ali","family":"Kazmi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S.: Quantum copy-protection and quantum money. In: 24th Annual Conference on Computational Complexity\u2013CCC 2009, pp. 229\u2013242 (2009). https:\/\/doi.org\/10.1109\/CCC.2009.42","DOI":"10.1109\/CCC.2009.42"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. Phys. Rev. A 70(5), 052328 (2004). https:\/\/doi.org\/10.1103\/PhysRevA.70.052328","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"2_CR3","unstructured":"Alagic, G., Brakerski, Z., Dulek, Y., Schaffner, C.: Impossibility of quantum virtual black-box obfuscation of classical circuits (2020). https:\/\/arxiv.org\/abs\/2005.06432"},{"key":"2_CR4","unstructured":"Alagic, G., Fefferman. G.: On quantum obfuscation (2016). https:\/\/arxiv.org\/abs\/1602.01771"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Alagic, G., Jeffery, S., Jordan. S.: Circuit obfucation using braids. In: 9th Conference on the Theory of Quantum Computation, Communication and Cryptography-TQC 2014, pp. 141\u2013160 (2014). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2014.141","DOI":"10.4230\/LIPIcs.TQC.2014.141"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Albrecht, M., Bai, S., Ducas, L.: A subfield lattice attack on overstretched NTRU assumptions. In : Advances in Cryptology\u2013CRYPTO 2016, vol. 1, pp. 153\u2013178 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_6","DOI":"10.1007\/978-3-662-53018-4_6"},{"issue":"10","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time $$T$$-depth optimization of Clifford+$$T$$ circuits via matroid partitioning. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 33(10), 1476\u20131489 (2014). https:\/\/doi.org\/10.1109\/TCAD.2014.2341953","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"issue":"6","key":"2_CR8","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 32(6), 818\u2013830 (2013). https:\/\/doi.org\/10.1109\/TCAD.2013.2244643","journal-title":"IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst."},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Ananth, P., Jain, A., Lin, H., Matt, C., Sahai, A.: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification. In: Advances in Cryptology\u2013CRYPTO 2019, vol. 3, pp.284\u2013332 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_10","DOI":"10.1007\/978-3-030-26954-8_10"},{"key":"2_CR10","unstructured":"Ananth, P., La Placa, R.L.: Secure software leasing (2020). https:\/\/arxiv.org\/abs\/2005.05289"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012). https:\/\/doi.org\/10.1145\/2160158.2160159","journal-title":"J. ACM"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Paneth, O.: ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation. In: 12th Theory of Cryptography Conference\u2013TCC 2015, vol. II, pp. 401\u2013427 (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_16","DOI":"10.1007\/978-3-662-46497-7_16"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Advances in Cryptology\u2013CRYPTO 2014, vol. I, pp. 480\u2013499 (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27","DOI":"10.1007\/978-3-662-44371-2_27"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Quantum FHE: (almost) as secure as classical. In: Advances in Cryptology\u2013CRYPTO 2018, vol. 3, pp. 67\u201395 (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_3","DOI":"10.1007\/978-3-319-96878-0_3"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Jeffery, S.: Quantum homomorphic encryption for circuits of low T-gate complexity. In: Advances in Cryptology\u2013CRYPTO 2015, vol. 2, pp. 609\u2013629 (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_30","DOI":"10.1007\/978-3-662-48000-7_30"},{"key":"2_CR16","unstructured":"Broadbent, A., Kazmi, R.A.: Constructions for quantum indistinguishability obfuscation (2020). https:\/\/eprint.iacr.org\/2020\/639"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Lord, S.: Uncloneable quantum encryption via oracles. In: Theory of Quantum Computation, Communication, and Cryptography\u2013TQC 2020, pp. 4:1\u20134:22 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2020.4","DOI":"10.4230\/LIPIcs.TQC.2020.4"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: 12th Theory of Cryptography Conference\u2013TCC 2015, vol. II, pp. 468\u2013497 (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_19","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Chen, Y., Gentry, C., Halevi, S.: Cryptanalyses of candidate branching program obfuscators. In: Advances in Cryptology\u2013EUROCRYPT 2017, vol. 3, pp. 278\u2013307 (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_10","DOI":"10.1007\/978-3-319-56617-7_10"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Coron, J.-S. Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Advances in Cryptology\u2013CRYPTO 2013, vol. 1, pp. 476\u2013493 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_26","DOI":"10.1007\/978-3-642-40041-4_26"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Cramer, R., Ducas, L., Peikert, C., Regev, O.: Recovering short generators of principal ideals in cyclotomic rings. In: Advances in Cryptology\u2013EUROCRYPT 2016, vol. 2, pp. 559\u2013585 (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_20","DOI":"10.1007\/978-3-662-49896-5_20"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Di Matteo, O., Mosca, M.: Parallelizing quantum circuit synthesis. Quant. Sci. Technol. 1(1), 015003 (2016). https:\/\/doi.org\/10.1088\/2058-9565\/1\/1\/015003","DOI":"10.1088\/2058-9565\/1\/1\/015003"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Dulek, Y., Schaffner, C., Speelman, F.: Quantum homomorphic encryption for polynomial-sized circuits. In: Advances in Cryptology\u2013CRYPTO 2016, pp. 3\u201332 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_1","DOI":"10.1007\/978-3-662-53015-3_1"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual Symposium on Foundations of Computer Science\u2013FOCS 2013, pp.40\u201349 (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Gay, R., Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from simple-to-state hardness assumptions (2021). https:\/\/eprint.iacr.org\/2020\/764.pdf","DOI":"10.1145\/3406325.3451093"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Gentry, C., Gorbunov, S., Halevi, S.: Graph-induced multilinear maps from lattices. In: 12th Theory of Cryptography Conference\u2013TCC 2015, vol. 2, pp. 498\u2013527 (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_20","DOI":"10.1007\/978-3-662-46497-7_20"},{"key":"2_CR27","unstructured":"Giles, B., Selinger, P.: Remarks on Matsumoto and Amano\u2019s normal form for single-qubit Clifford+$${T}$$ operators (2019). https:\/\/arxiv.org\/abs\/1312.6584"},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s00145-013-9151-z","volume":"27","author":"S Goldwasser","year":"2014","unstructured":"Goldwasser, S., Rothblum, G.N.: On best-possible obfuscation. J. Cryptol. 27(3), 480\u2013505 (2014). https:\/\/doi.org\/10.1007\/s00145-013-9151-z","journal-title":"J. Cryptol."},{"key":"2_CR29","unstructured":"Gottesman, D.: The Heisenberg representation of quantum computers. In: 22nd International Colloquium on Group Theoretical Methods in Physics\u2013GROUP 22, pp. 32\u201343 (1998). http:\/\/arxiv.org\/abs\/quant-ph\/9807006"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1038\/46503","volume":"402","author":"D Gottesman","year":"1999","unstructured":"Gottesman, D., Chuang, I.L.: Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402, 390\u2013393 (1999). https:\/\/doi.org\/10.1038\/46503","journal-title":"Nature"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Guo, S., Malkin, T., Oliveira, I.C., Rosen, A.: The power of negations in cryptography. In: 12th Theory of Cryptography Conference\u2013TCC 2015, vol. 1, pp. 36\u201365 (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_3","DOI":"10.1007\/978-3-662-46494-6_3"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions (2020). https:\/\/eprint.iacr.org\/2020\/1003","DOI":"10.1145\/3406325.3451093"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Kaye, P., Laflamme, R., Mosca, R.: An Introduction to Quantum Computing. Oxford University Press, Oxford (2007)","DOI":"10.1093\/oso\/9780198570004.001.0001"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Langlois, A., Stehl\u00e9, D., Steinfeld, R.: GGHLite: more efficient multilinear maps from ideal lattices. In: Advances in Cryptology\u2013EUROCRYPT 2014, pp. 239\u2013256 (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_14","DOI":"10.1007\/978-3-642-55220-5_14"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Low, R.A.: Learning and testing algorithms for the Clifford group. Phys. Rev. 80(5):052314 (2009). http:\/\/dx.doi.org\/https:\/\/doi.org\/10.1103\/PhysRevA.80.052314","DOI":"10.1103\/PhysRevA.80.052314"},{"key":"2_CR36","unstructured":"Matsumoto, K., Amano, K.: Representation of quantum circuits with Clifford and $$\\pi \/8$$ gates (2008). https:\/\/arxiv.org\/abs\/0806.3834"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Niemann, P., Wille, R., Drechsler, R.: Efficient synthesis of quantum circuits implementing Clifford group operations. In: 19th Asia and South Pacific Design Automation Conference\u2013ASP-DAC 2014, pp. 483\u2013488 (2014). https:\/\/doi.org\/10.1109\/ASPDAC.2014.6742938","DOI":"10.1109\/ASPDAC.2014.6742938"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: 46th Annual ACM Symposium on Theory of Computing\u2013STOC 2014, pp. 475\u2013484 (2014). https:\/\/doi.org\/10.1145\/2591796.2591825","DOI":"10.1145\/2591796.2591825"},{"key":"2_CR39","unstructured":"Selinger, R.: Generators and relations for $$n$$-qubit Clifford operators (2013). https:\/\/arxiv.org\/abs\/1310.6813"},{"key":"2_CR40","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Cengage Learning, 3rd edn. Cengage, Boston (2012)"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Speelman. F.: Instantaneous non-local computation of low $$T$$-depth quantum circuits. In: 11th Conference on the Theory of Quantum Computation, Communication and Cryptography\u2013TQC 2016, pp. 9:1\u20139:24 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2016.9","DOI":"10.4230\/LIPIcs.TQC.2016.9"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88238-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:57:10Z","timestamp":1710269830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88238-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030882372","9783030882389"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88238-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bogot\u00e1","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/urosario.edu.co\/Latin-Crypt\/inicio\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}