{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T18:43:09Z","timestamp":1780339389790,"version":"3.54.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643805","type":"print"},{"value":"9783030643812","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64381-2_5","type":"book-chapter","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T18:04:25Z","timestamp":1607796265000},"page":"123-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Secure Quantum Extraction Protocols"],"prefix":"10.1007","author":[{"given":"Prabhanjan","family":"Ananth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolando L.","family":"La Placa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Bartusek, J., Goyal, V., Khurana, D., Malavolta, G.: Post-quantum multi-party computation in constant rounds (2020)","DOI":"10.1007\/978-3-030-77870-5_16"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alagic, G., Brakerski, Z., Dulek, Y., Schaffner, C.: Impossibility of quantum virtual black-box obfuscation of classical circuits (2020)","DOI":"10.1007\/978-3-030-84242-0_18"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: FOCS (2014)","DOI":"10.1109\/FOCS.2014.57"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1007\/978-3-319-70500-2_21","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2017","unstructured":"Ananth, P., Jain, A.: On secure two-party computation in three rounds. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 612\u2013644. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_21"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ananth, P., La Placa, R.L.: Secure quantum extraction protocols. arXiv preprint arXiv:1911.07672 (2019)","DOI":"10.1007\/978-3-030-64381-2_5"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ananth, P., La Placa, R.L.: Secure software leasing. arXiv preprint arXiv:2005.05289 (2020)","DOI":"10.1007\/978-3-030-77886-6_17"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 106\u2013115. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-662-53641-4_3","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2016","unstructured":"Bitansky, N., Brakerski, Z., Kalai, Y., Paneth, O., Vaikuntanathan, V.: 3-message zero knowledge against human ignorance. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 57\u201383. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_3"},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1137\/140975048","volume":"45","author":"N Bitansky","year":"2016","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. SIAM J. Comput. 45(5), 1910\u20131952 (2016)","journal-title":"SIAM J. Comput."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Kalai, Y.T., Paneth, O.: Multi-collision resistance: a paradigm for keyless hash functions. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 671\u2013684. ACM (2018)","DOI":"10.1145\/3188745.3188870"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Khurana, D., Paneth, O.: Weak zero-knowledge beyond the black-box barrier. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 1091\u20131102. ACM (2019)","DOI":"10.1145\/3313276.3316382"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Shmueli, O.: Post-quantum zero knowledge in constant rounds. In: STOC (2020)","DOI":"10.1145\/3357713.3384324"},{"key":"5_CR13","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, vol. 1, p. 2. Citeseer (1986)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-96878-0_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z.: Quantum FHE (almost) as secure as classical. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 67\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_3"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U., Vidick, T.: A cryptographic test of quantumness and certifiable randomness from a single quantum device. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 320\u2013331. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00038"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Ji, Z., Song, F., Watrous, J.: Zero-knowledge proof systems for QMA. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 31\u201340. IEEE (2016)","DOI":"10.1109\/FOCS.2016.13"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-540-78524-8_28","volume-title":"Theory of Cryptography","author":"A Chailloux","year":"2008","unstructured":"Chailloux, A., Ciocan, D.F., Kerenidis, I., Vadhan, S.: Interactive and noninteractive zero knowledge are equivalent in the help model. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 501\u2013534. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_28"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput. 29(1), 1\u201328 (1999)","journal-title":"SIAM J. Comput."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C., et al.: Fully homomorphic encryption using ideal lattices. In: STOC, vol. 9, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-14623-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: i-hop homomorphic encryption and rerandomizable yao circuits. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 155\u2013172. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_9"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 174\u2013187. IEEE (1986)","DOI":"10.1109\/SFCS.1986.47"},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1\u201332 (1994). https:\/\/doi.org\/10.1007\/BF00195207","journal-title":"J. Cryptol."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 612\u2013621. IEEE (2017)","DOI":"10.1109\/FOCS.2017.62"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-540-70583-3_48","volume-title":"Automata, Languages and Programming","author":"S Hallgren","year":"2008","unstructured":"Hallgren, S., Kolla, A., Sen, P., Zhang, S.: Making classical honest verifier zero knowledge protocols secure against quantum attacks. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 592\u2013603. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_48"},{"key":"5_CR27","unstructured":"Jain, R., Kolla, A., Midrijanis, G., Reichardt, B.W.: On parallel composition of zero-knowledge proofs with black-box quantum simulators. arXiv preprint quant-ph\/0607211 (2006)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-26954-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"YT Kalai","year":"2019","unstructured":"Kalai, Y.T., Khurana, D.: Non-interactive non-malleability from quantum supremacy. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 552\u2013582. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_18"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-78524-8_7","volume-title":"Theory of Cryptography","author":"H Kobayashi","year":"2008","unstructured":"Kobayashi, H.: General properties of quantum zero-knowledge proofs. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 107\u2013124. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_7"},{"key":"5_CR30","first-page":"279","volume":"2019","author":"A Lombardi","year":"2019","unstructured":"Lombardi, A., Schaeffer, L.: A note on key agreement and non-interactive commitments. IACR Cryptol. ePrint Arch. 2019, 279 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 332\u2013338. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00039"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 259\u2013267. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"key":"5_CR33","unstructured":"Matsumoto, K.: A simpler proof of zero-knowledge against quantum attacks using Grover\u2019s amplitude amplification. arXiv preprint quant-ph\/0602186 (2006)"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.: Quantum computation and quantum information (2002)","DOI":"10.1119\/1.1463744"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 160\u2013176. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_10"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-00457-5_24","volume-title":"Theory of Cryptography","author":"R Pass","year":"2009","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 403\u2013418. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_24"},{"key":"5_CR37","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS (2002)"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Unruh","year":"2012","unstructured":"Unruh, D.: Quantum proofs of knowledge. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 135\u2013152. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_10"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-40084-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Unruh","year":"2013","unstructured":"Unruh, D.: Everlasting multi-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 380\u2013397. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_22"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49896-5_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Computationally binding quantum commitments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 497\u2013527. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_18"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Vidick, T., Zhang, T.: Classical zero-knowledge arguments for quantum computations. arXiv preprint arXiv:1902.05217 (2019)","DOI":"10.22331\/q-2020-05-14-266"},{"issue":"1","key":"5_CR42","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/060670997","volume":"39","author":"J Watrous","year":"2009","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. SIAM J. Comput. 39(1), 25\u201358 (2009)","journal-title":"SIAM J. Comput."},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Wichs , D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 600\u2013611. IEEE (2017)","DOI":"10.1109\/FOCS.2017.61"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64381-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T01:07:31Z","timestamp":1702343251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64381-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643805","9783030643812"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64381-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"167","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":"71","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":"43% - 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":"4","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":"17","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":"Due to the Corona pandemic this event was held virtually.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}