{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:48:14Z","timestamp":1746517694614,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030346201"},{"type":"electronic","value":"9783030346218"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34621-8_14","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:14:54Z","timestamp":1574381694000},"page":"386-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2447-4329","authenticated-orcid":false,"given":"Michel","family":"Abdalla","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-1820","authenticated-orcid":false,"given":"Fabrice","family":"Benhamouda","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Passel\u00e8gue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-662-53018-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Bai, S., Ducas, L.: A subfield lattice attack on overstretched NTRU assumptions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 153\u2013178. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_6"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-47989-6_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Abdalla","year":"2015","unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A.: An algebraic framework for pseudorandom functions and applications to related-key security. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 388\u2013409. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_19"},{"unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A.: Algebraic XOR-RKA-secure pseudorandom functions from post-zeroizing multilinear maps. Cryptology ePrint Archive, Report 2017\/500 (2017). http:\/\/eprint.iacr.org\/2017\/500","key":"14_CR3"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-662-44371-2_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"M Abdalla","year":"2014","unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A., Paterson, K.G.: Related-key security for pseudorandom functions beyond the linear barrier. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 77\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_5"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s00145-017-9274-8","volume":"31","author":"M Abdalla","year":"2018","unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A., Paterson, K.G.: Related-key security for pseudorandom functions beyond the linear barrier. J. Cryptol. 31(4), 917\u2013964 (2018)","journal-title":"J. Cryptol."},{"unstructured":"Applebaum, B., Widder, E.: Related-key secure pseudorandom functions: the case of additive attacks. Cryptology ePrint Archive, Report 2014\/478 (2014). http:\/\/eprint.iacr.org\/2014\/478","key":"14_CR6"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-642-14623-7_36","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"M Bellare","year":"2010","unstructured":"Bellare, M., Cash, D.: Pseudorandom functions and permutations provably secure against related-key attacks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 666\u2013684. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_36"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-25385-0_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"M Bellare","year":"2011","unstructured":"Bellare, M., Cash, D., Miller, R.: Cryptography secure against related-key attacks and tampering. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 486\u2013503. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_26"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/11426639_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"E Biham","year":"2005","unstructured":"Biham, E., Dunkelman, O., Keller, N.: Related-key boomerang and rectangle attacks. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 507\u2013525. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_30"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-13190-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A Biryukov","year":"2010","unstructured":"Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., Shamir, A.: Key recovery attacks of practical complexity on AES-256 variants with up to 10 Rounds. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 299\u2013319. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_15"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-55220-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"B Barak","year":"2014","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A.: Protecting obfuscation against algebraic attacks. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 221\u2013238. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_13"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-48285-7_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1993","author":"E Biham","year":"1994","unstructured":"Biham, E.: New types of cryptanalytic attacks using related keys. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 398\u2013409. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_34"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-39200-9_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Kohno, T.: A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 491\u2013506. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_31"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-662-49896-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"S Badrinarayanan","year":"2016","unstructured":"Badrinarayanan, S., Miles, E., Sahai, A., Zhandry, M.: Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 764\u2013791. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_27"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-662-44371-2_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"A Banerjee","year":"2014","unstructured":"Banerjee, A., Peikert, C.: New and improved key-homomorphic pseudorandom functions. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 353\u2013370. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_20"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-54242-8_1","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Rothblum, G.N.: Virtual black-box obfuscation for all circuits via generic graded encoding. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 1\u201325. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_1"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-662-49890-3_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"JH Cheon","year":"2016","unstructured":"Cheon, J.H., Fouque, P.A., Lee, C., Minaud, B., Ryu, H.: Cryptanalysis of the new CLT multilinear map over the integers. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 509\u2013536. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_20"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-662-47989-6_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"JS Coron","year":"2015","unstructured":"Coron, J.S., et al.: Zeroizing without low-level zeroes: new MMAP attacks and their limitations. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 247\u2013266. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_12"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-319-56617-7_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Gentry, C., Halevi, S.: Cryptanalyses of candidate branching program obfuscators. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 278\u2013307. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_10"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"40096","DOI":"10.1109\/ACCESS.2018.2850361","volume":"6","author":"JH Cheon","year":"2018","unstructured":"Cheon, J.H., Hhan, M., Kim, J., Lee, C.: Cryptanalysis on the HHSS obfuscation arising from absence of safeguards. IEEE Access 6, 40096\u201340104 (2018)","journal-title":"IEEE Access"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46800-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"JH Cheon","year":"2015","unstructured":"Cheon, J.H., Han, K., Lee, C., Ryu, H., Stehl\u00e9, D.: Cryptanalysis of the multilinear map over the integers. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 3\u201312. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_1"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1112\/S1461157016000371","volume":"19A","author":"JH Cheon","year":"2016","unstructured":"Cheon, J.H., Jeong, J., Lee, C.: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero. LMS J. Comput. Math. 19A, 255\u2013266 (2016)","journal-title":"LMS J. Comput. Math."},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-662-53008-5_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"JS Coron","year":"2016","unstructured":"Coron, J.S., Lee, M.S., Lepoint, T., Tibouchi, M.: Cryptanalysis of GGH15 multilinear maps. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 607\u2013628. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_21"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-662-54365-8_3","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"JS Coron","year":"2017","unstructured":"Coron, J.S., Lee, M.S., Lepoint, T., Tibouchi, M.: Zeroizing attacks on indistinguishability obfuscation over CLT13. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 41\u201358. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_3"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"JS Coron","year":"2013","unstructured":"Coron, J.S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_26"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-662-47989-6_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"JS Coron","year":"2015","unstructured":"Coron, J.S., Lepoint, T., Tibouchi, M.: New multilinear maps over the integers. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 267\u2013286. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_13"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-662-46800-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"B Cogliati","year":"2015","unstructured":"Cogliati, B., Seurin, Y.: On the provable security of the iterated even-mansour cipher against related-key and chosen-key attacks. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 584\u2013613. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_23"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-319-96881-0_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Vaikuntanathan, V., Wee, H.: GGH15 beyond permutation branching programs: proofs, attacks, and candidates. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 577\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_20"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-662-48116-5_17","volume-title":"Fast Software Encryption","author":"P Farshim","year":"2015","unstructured":"Farshim, P., Procter, G.: The related-key security of iterated Even-Mansour ciphers. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 342\u2013363. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_17"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-22174-8_1","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"E Fujisaki","year":"2015","unstructured":"Fujisaki, E., Xagawa, K.: Efficient RKA-secure KEM and IBE schemes against invertible functions. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 3\u201320. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_1"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_1"},{"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 Annual Symposium on Foundations of Computer Science, pp. 40\u201349. IEEE Computer Society Press, October 2013","key":"14_CR34","DOI":"10.1109\/FOCS.2013.13"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-662-46497-7_20","volume-title":"Theory of Cryptography","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Gorbunov, S., Halevi, S.: Graph-induced multilinear maps from lattices. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 498\u2013527. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_20"},{"issue":"4","key":"14_CR36","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C., Lewko, A.B., Sahai, A., Waters, B.: Indistinguishability obfuscation from the multilinear subgroup elimination assumption. In: Guruswami, V. (ed.) 56th Annual Symposium on Foundations of Computer Science, pp. 151\u2013170. IEEE Computer Society Press, October 2015","key":"14_CR37","DOI":"10.1109\/FOCS.2015.19"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-662-44371-2_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"C Gentry","year":"2014","unstructured":"Gentry, C., Lewko, A., Waters, B.: Witness encryption from instance independent assumptions. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 426\u2013443. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_24"},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-53644-5_10","volume-title":"Theory of Cryptography","author":"S Garg","year":"2016","unstructured":"Garg, S., Miles, E., Mukherjee, P., Sahai, A., Srinivasan, A., Zhandry, M.: Secure obfuscation in a weak multilinear map model. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 241\u2013268. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_10"},{"unstructured":"Halevi, S.: Graded encoding, variations on a scheme. Cryptology ePrint Archive, Report 2015\/866 (2015). http:\/\/eprint.iacr.org\/2015\/866","key":"14_CR40"},{"key":"14_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-662-49890-3_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Jia, H.: Cryptanalysis of GGH map. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 537\u2013565. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_21"},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-662-46494-6_19","volume-title":"Theory of Cryptography","author":"Z Jafargholi","year":"2015","unstructured":"Jafargholi, Z., Wichs, D.: Tamper detection and continuous non-malleable codes. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 451\u2013480. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_19"},{"key":"14_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-57220-1_62","volume-title":"Advances in Cryptology \u2014 AUSCRYPT 1992","author":"LR Knudsen","year":"1993","unstructured":"Knudsen, L.R.: Cryptanalysis of LOKI 91. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 196\u2013208. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_62"},{"key":"14_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-07536-5_4","volume-title":"Applied Cryptography and Network Security","author":"K Lewi","year":"2014","unstructured":"Lewi, K., Montgomery, H., Raghunathan, A.: Improved constructions of PRFs secure against related-key attacks. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 44\u201361. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_4"},{"key":"14_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-662-53018-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"B Mennink","year":"2016","unstructured":"Mennink, B.: XPX: generalized tweakable Even-Mansour with improved security guarantees. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 64\u201394. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_3"},{"unstructured":"Miles, E., Sahai, A., Weiss, M.: Protecting obfuscation against arithmetic attacks. Cryptology ePrint Archive, Report 2014\/878 (2014). http:\/\/eprint.iacr.org\/2014\/878","key":"14_CR46"},{"key":"14_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-662-53008-5_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Miles","year":"2016","unstructured":"Miles, E., Sahai, A., Zhandry, M.: Annihilation attacks for multilinear maps: cryptanalysis of indistinguishability obfuscation over GGH13. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 629\u2013658. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_22"},{"unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th Annual Symposium on Foundations of Computer Science, pp. 458\u2013467. IEEE Computer Society Press, October 1997","key":"14_CR48"},{"key":"14_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"14_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-662-52993-5_26","volume-title":"Fast Software Encryption","author":"P Wang","year":"2016","unstructured":"Wang, P., Li, Y., Zhang, L., Zheng, K.: Related-key almost universal hash functions: definitions, constructions and applications. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 514\u2013532. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_26"},{"key":"14_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-662-46803-6_15","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Zimmerman","year":"2015","unstructured":"Zimmerman, J.: How to obfuscate programs directly. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 439\u2013467. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34621-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:36:46Z","timestamp":1710261406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-34621-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030346201","9783030346218"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34621-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kobe","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2019\/index.html","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":"IACR Web submission software","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"307","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":"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.5","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)"}}]}}