{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:16:18Z","timestamp":1779934578792,"version":"3.53.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031070815","type":"print"},{"value":"9783031070822","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-07082-2_18","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:09:51Z","timestamp":1653696591000},"page":"488-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Watermarking PRFs Against Quantum Adversaries"],"prefix":"10.1007","author":[{"given":"Fuyuki","family":"Kitagawa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Ananth, P., La Placa, R.L.: Secure software leasing. In EUROCRYPT 2021, Part II, pp. 501\u2013530 (2021)","DOI":"10.1007\/978-3-030-77886-6_17"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Liu, J., Liu, Q., Zhandry, M., Zhang, R.: New approaches for quantum copy-protection. In: CRYPTO 2021, Part I, pp. 526\u2013555. Virtual Event (2021)","DOI":"10.1007\/978-3-030-84242-0_19"},{"key":"18_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 (2014)","DOI":"10.1109\/FOCS.2014.57"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: ASIACRYPT, pp. 41\u201369 (2011)","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Barak, B., et al.: On the (IM) possibility of obfuscating programs. J. ACM 59(2), 6:1\u20136:48 (2012)","DOI":"10.1145\/2160158.2160159"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lewi, K., Wu, D.J.: Constraining pseudorandom functions privately. In: PKC 2017, Part II, pp. 494\u2013524 (2017)","DOI":"10.1007\/978-3-662-54388-7_17"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short Ciphertexts and private keys. In: EUROCRYPT 2006, pp. 573\u2013592 (2006)","DOI":"10.1007\/11761679_34"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: CRYPTO 1994, pp. 257\u2013270 (1994)","DOI":"10.1007\/3-540-48658-5_25"},{"issue":"6","key":"18_CR9","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1137\/18M1164834","volume":"47","author":"A Cohen","year":"2018","unstructured":"Cohen, A., Holmgren, J., Nishimaki, R., Vaikuntanathan, V., Wichs, D.: Watermarking cryptographic capabilities. SIAM J. Comput. 47(6), 2157\u20132202 (2018)","journal-title":"SIAM J. Comput."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments: breaking the quantum rewinding barrier. In: FOCS 2021 (2021)","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Goyal, R., Kim, S., Manohar, N., Waters, B., Wu, D.J.: Watermarking public-key cryptographic primitives. In: CRYPTO 2019, Part III, pp. 367\u2013398 (2019)","DOI":"10.1007\/978-3-030-26954-8_12"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Goyal, R., Kim, S., Waters, B., Wu, D.J.: Beyond software watermarking: traitor-tracing for pseudorandom functions. In: Asiacrypt 2021, LNCS, Springer Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3","DOI":"10.1007\/978-3-030-92062-3"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Hopper, N., Molnar, D., Wagner, D.: From weak to strong watermarking. In: TCC 2007, pp. 362\u2013382 (2007)","DOI":"10.1007\/978-3-540-70936-7_20"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-030-90459-3_2","volume-title":"Theory of Cryptography","author":"F Kitagawa","year":"2021","unstructured":"Kitagawa, F., Nishimaki, R., Yamakawa, T.: Secure software leasing from standard assumptions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 31\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_2"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Kim, S., Wu, D.J.: Watermarking PRFs from lattices: stronger security via extractable PRFs. In: CRYPTO 2019, Part III, pp. 335\u2013366 (2019)","DOI":"10.1007\/978-3-030-26954-8_11"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s00145-021-09391-2","volume":"34","author":"S Kim","year":"2021","unstructured":"Kim, S., Wu, D.J.: Watermarking cryptographic functionalities from standard lattice assumptions. J. Cryptol. 34(3), 28 (2021)","journal-title":"J. Cryptol."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Nishimaki, R.: How to watermark cryptographic functions. In: EUROCRYPT 2013, pp. 111\u2013125 (2013)","DOI":"10.1007\/978-3-642-38348-9_7"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Nishimaki, R.: How to watermark cryptographic functions by bilinear maps. IEICE Trans. 102 A(1):99\u2013113 (2019)","DOI":"10.1587\/transfun.E102.A.99"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Nishimaki, R.: Equipping public-key cryptographic primitives with watermarking (or: a hole is to watermark). In: TCC 2020, Part I, pp. 179\u2013209 (2020)","DOI":"10.1007\/978-3-030-64375-1_7"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Naccache, D., Shamir, A., Stern, J.P.: How to copyright a function? In: PKC 1999, pp. 188\u2013196 (1999)","DOI":"10.1007\/3-540-49162-7_14"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Quach, W., Wichs, D., Zirdelis, G.: Watermarking PRFs under standard assumptions: public marking and security with extraction queries. In: TCC 2018, Part II, pp. 669\u2013698 (2018)","DOI":"10.1007\/978-3-030-03810-6_24"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Quantum proofs of knowledge. In: EUROCRYPT 2012, pp. 135\u2013152 (2012)","DOI":"10.1007\/978-3-642-29011-4_10"},{"issue":"1","key":"18_CR24","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":"18_CR25","doi-asserted-by":"crossref","unstructured":"Yang, R., Au, M.H., Lai, J., Xu, Q., Yu, Z.: Collusion resistant watermarking schemes for cryptographic functionalities. In: ASIACRYPT 2019, Part I, pp. 371\u2013398 (2019)","DOI":"10.1007\/978-3-030-34578-5_14"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Yang, R., Au, M.H., Yu, Z., Xu, Q.: Collusion resistant watermarkable PRFs from standard assumptions. In: CRYPTO 2020, Part I, pp. 590\u2013620 (2020)","DOI":"10.1007\/978-3-030-56784-2_20"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Yoshida, M., Fujiwara, T.: Toward digital watermarking for cryptographic data. IEICE Trans. 94-A(1):270\u2013272 (2011)","DOI":"10.1587\/transfun.E94.A.270"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to construct quantum random functions. In: 53rd FOCS, pp. 679\u2013687 (2012)","DOI":"10.1109\/FOCS.2012.37"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Secure identity-based encryption in the quantum random oracle model. In: CRYPTO 2012, pp. 758\u2013775 (2012)","DOI":"10.1007\/978-3-642-32009-5_44"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. In: CRYPTO 2019, Part II, pp. 239\u2013268 (2019)","DOI":"10.1007\/978-3-030-26951-7_9"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Schr\u00f6dinger\u2019s pirate: how to trace a quantum decoder. In: TCC 2020, Part III, pp. 61\u201391 (2020)","DOI":"10.1007\/978-3-030-64381-2_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07082-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:03:00Z","timestamp":1748383380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07082-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031070815","9783031070822"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07082-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2022\/","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":"372","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":"85","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":"23% - 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":"18","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":"Peer review was double-blind with rebuttal.","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)"}}]}}