{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:12:48Z","timestamp":1757455968913,"version":"3.41.2"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031385537"},{"type":"electronic","value":"9783031385544"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38554-4_1","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"3-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tracing Quantum State Distinguishers via Backtracking"],"prefix":"10.1007","author":[{"given":"Mark","family":"Zhandry","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"1_CR1","series-title":"Part I, volume 11476 of LNCS","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-17653-2_7","volume-title":"EUROCRYPT 2019","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S.: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. Part I, volume 11476 of LNCS, pp. 191\u2013225. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_7"},{"key":"1_CR2","series-title":"Part I, volume 12105 of LNCS","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-45721-1_5","volume-title":"EUROCRYPT 2020","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Pellet-Mary, A.: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. Part I, volume 12105 of LNCS, pp. 110\u2013140. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_5"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: 55th FOCS, pp. 474\u2013483. IEEE Computer Society Press, October 2014","DOI":"10.1109\/FOCS.2014.57"},{"key":"1_CR4","series-title":"Part I, vol. 9562 of LNCS","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-662-49096-9_6","volume-title":"TCC 2016-A","author":"PV Ananth","year":"2016","unstructured":"Ananth, P.V., Sahai, A.: Functional encryption for turing machines. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016-A. Part I, vol. 9562 of LNCS, pp. 125\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_6"},{"key":"1_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-54242-8_3","volume-title":"TCC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: On extractability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 52\u201373. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_3"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random Oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"1_CR7","series-title":"Part I, volume 12105 of LNCS","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-45721-1_4","volume-title":"EUROCRYPT 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Candidate iO from homomorphic encryption schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. Part I, volume 12105 of LNCS, pp. 79\u2013109. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_4"},{"key":"1_CR8","series-title":"Part II, volume 11240 of LNCS","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-030-03810-6_20","volume-title":"TCC 2018","author":"J Bartusek","year":"2018","unstructured":"Bartusek, J., Guan, J., Ma, F., Zhandry, M.: Return of GGH15: provable security against zeroizing attacks. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. Part II, volume 11240 of LNCS, pp. 544\u2013574. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_20"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 501\u2013510. ACM Press, October 2008","DOI":"10.1145\/1455770.1455834"},{"key":"1_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-85093-9_17","volume-title":"ICITS 2008","author":"Q Billet","year":"2008","unstructured":"Billet, Q., Phan, D.H.: Efficient traitor tracing from collusion secure codes. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 171\u2013182. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85093-9_17"},{"key":"1_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/3-540-44750-4_36","volume-title":"CRYPTO 1995","author":"D Boneh","year":"1995","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data (extended abstract). In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452\u2013465. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_36"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short ciphertexts and private keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 573\u2013592. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_34"},{"key":"1_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"CRYPTO 1994","author":"B Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257\u2013270. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_25"},{"key":"1_CR14","series-title":"Part I, volume 11891 of LNCS","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-36030-6_3","volume-title":"TCC 2019","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Hhan, M., Vaikuntanathan, V., Wee, H.: Matrix PRFs: constructions, attacks, and applications to obfuscation. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. Part I, volume 11891 of LNCS, pp. 55\u201380. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_3"},{"key":"1_CR15","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments. In: Proceedings of FOCS 2021 (2021)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-04268-8_9","volume-title":"Information Theoretic Security","author":"I Damg\u00e5rd","year":"2014","unstructured":"Damg\u00e5rd, I., Funder, J., Nielsen, J.B., Salvail, L.: Superposition attacks on cryptographic protocols. In: Padr\u00f3, C. (ed.) ICITS 2013. LNCS, vol. 8317, pp. 142\u2013161. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04268-8_9"},{"key":"1_CR17","series-title":"Part II, volume 13043 of LNCS","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-90453-1_9","volume-title":"TCC 2021","author":"L Devadas","year":"2021","unstructured":"Devadas, L., Quach, W., Vaikuntanathan, V., Wee, H., Wichs, D.: Succinct LWE sampling, random polynomials, and obfuscation. In: Nissim, K., Waters, B. (eds.) TCC 2021. Part II, volume 13043 of LNCS, pp. 256\u2013287. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_9"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS, pp. 40\u201349. IEEE Computer Society Press, October 2013","DOI":"10.1109\/FOCS.2013.13"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 555\u2013564. ACM Press, June 2013","DOI":"10.1145\/2488608.2488678"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Collusion resistant traitor tracing from learning with errors. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 660\u2013670. ACM Press, June 2018","DOI":"10.1145\/3188745.3188844"},{"key":"1_CR21","series-title":"Part II, volume 11892 of LNCS","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-36033-7_6","volume-title":"TCC 2019","author":"R Goyal","year":"2019","unstructured":"Goyal, R., Koppula, V., Waters, B.: New approaches to traitor tracing with embedded identities. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. Part II, volume 11892 of LNCS, pp. 149\u2013179. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_6"},{"key":"1_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-32009-5_11","volume-title":"CRYPTO 2012","author":"S Gorbunov","year":"2012","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption with bounded collusions via multi-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 162\u2013179. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_11"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Hollmann, H.D.L., van Lint, J.H., Linnartz, J.-P., Tolhuizen, L.M.G.M.: On codes with the identifiable parent property. J. Comb. Theory Ser. A 82(2), 121\u2013133 (1998)","DOI":"10.1006\/jcta.1997.2851"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round Feistel cipher and the random permutation. In: 2010 IEEE International Symposium on Information Theory, pp. 2682\u20132685 (2010)","DOI":"10.1109\/ISIT.2010.5513654"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Kitagawa, F., Nishimaki, R.: Watermarking PRFs against quantum adversaries. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III, vol. 13277. LNCS, pp. 488\u2013518. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_18","DOI":"10.1007\/978-3-031-07082-2_18"},{"key":"1_CR26","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited (or: how to do quantum rewinding undetectably). Cryptology ePrint Archive, Report 2021\/1543 (2021). https:\/\/eprint.iacr.org\/2021\/1543"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Marriott, C., Watrous, J.: Quantum Arthur-Merlin games. In: Proceedings of 19th IEEE Annual Conference on Computational Complexity, pp. 275\u2013285 (2004)","DOI":"10.1109\/CCC.2004.1313850"},{"key":"1_CR28","series-title":"Part II, vol. 9666 of LNCS","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-49896-5_14","volume-title":"EUROCRYPT 2016","author":"R Nishimaki","year":"2016","unstructured":"Nishimaki, R., Wichs, D., Zhandry, M.: Anonymous traitor tracing: how to embed arbitrary information in a key. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. Part II, vol. 9666 of LNCS, pp. 388\u2013419. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_14"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press, November 1994","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1_CR30","unstructured":"Sirvent, T.: Traitor tracing scheme with constant ciphertext rate against powerful pirates. Cryptology ePrint Archive, Report 2006\/383 (2006). https:\/\/eprint.iacr.org\/2006\/383"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Tardos, G.: Optimal probabilistic fingerprint codes. In: 35th ACM STOC, pp. 116\u2013125. ACM Press, June 2003","DOI":"10.1145\/780542.780561"},{"key":"1_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","volume-title":"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":"1_CR33","unstructured":"Van De Graaf, J.: Towards a formal definition of security for quantum protocols. Ph.D. thesis, Universite de Montreal (1998)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. In: Kleinberg, J.M. (ed.) 38th ACM STOC, pp. 296\u2013305. ACM Press, May 2006","DOI":"10.1145\/1132516.1132560"},{"key":"1_CR35","series-title":"Part III, vol. 12698 of LNCS","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-77883-5_5","volume-title":"EUROCRYPT 2021","author":"H Wee","year":"2021","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. Part III, vol. 12698 of LNCS, pp. 127\u2013156. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to construct quantum random functions. In: 53rd FOCS, pp. 679\u2013687. IEEE Computer Society Press, October 2012","DOI":"10.1109\/FOCS.2012.37"},{"key":"1_CR37","series-title":"Part III, vol. 12552 of LNCS","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-64381-2_3","volume-title":"TCC 2020","author":"M Zhandry","year":"2020","unstructured":"Zhandry, M.: Schr\u00f6dinger\u2019s pirate: how to trace a quantum decoder. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. Part III, vol. 12552 of LNCS, pp. 61\u201391. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38554-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:23Z","timestamp":1753567403000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38554-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385537","9783031385544"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38554-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","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":"124","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":"26% - 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":"15","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)"}}]}}