{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:14:40Z","timestamp":1778109280608,"version":"3.51.4"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032174420","type":"print"},{"value":"9783032174437","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-17443-7_1","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T22:44:35Z","timestamp":1778107475000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adding Two Easy Functions Is Always Hard to\u00a0Invert"],"prefix":"10.1007","author":[{"given":"Hayato","family":"Gibo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yohei","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsugu","family":"Iwamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00145-014-9189-6","volume":"29","author":"JS Coron","year":"2014","unstructured":"Coron, J.S., Holenstein, T., K\u00fcnzler, R., Patarin, J., Seurin, Y., Tessaro, S.: How to build an ideal cipher: the indifferentiability of the feistel construction. J. Cryptol. 29, 61\u2013114 (2014)","journal-title":"J. Cryptol."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-662-49896-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Dachman-Soled","year":"2016","unstructured":"Dachman-Soled, D., Katz, J., Thiruvengadam, A.: 10-round feistel is indifferentiable from an ideal cipher. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 649\u2013678. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_23"},{"key":"1_CR3","unstructured":"Eisenberg, Y., Havens, C., Korb, A., Sahai, A.: Building hard problems by combining easy ones: Revisited. Cryptology ePrint Archive, Paper 2025\/223 (2025). https:\/\/eprint.iacr.org\/2025\/223"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Ghosal, R., Sahai, A.: Building hard problems by combining easy ones. In: IEEE ISIT 2023, pp. 1770\u20131775 (2023)","DOI":"10.1109\/ISIT54713.2023.10206689"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ghosal, R., Sahai, A.: Building hard problems by combining easy ones. Cryptology ePrint Archive, Paper 2023\/1088 (2023). https:\/\/eprint.iacr.org\/2023\/1088","DOI":"10.1109\/ISIT54713.2023.10206689"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 1: Basic Techniques. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-031-38548-3_21","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"A Gunsing","year":"2023","unstructured":"Gunsing, A., Bhaumik, R., Jha, A., Mennink, B., Shen, Y.: Revisiting the indifferentiability of the sum of permutations. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, pp. 628\u2013660. Springer Nature Switzerland, Cham (2023)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-13013-7_24","volume-title":"Public Key Cryptography - PKC 2010","author":"A Kawachi","year":"2010","unstructured":"Kawachi, A., Numayama, A., Tanaka, K., Xagawa, K.: Security of encryption schemes in weakened random oracle models. In: Nguyen, P.Q., Pointcheval, D. (eds.) Public Key Cryptography - PKC 2010, pp. 403\u2013419. Springer, Berlin Heidelberg, Berlin, Heidelberg (2010)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Theory of Cryptography, pp. 21\u201339 (2004)","DOI":"10.1007\/978-3-540-24638-1_2"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17443-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T22:44:37Z","timestamp":1778107477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17443-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032174420","9783032174437"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17443-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Technology and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","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":"itc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/secitc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}