{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:56:18Z","timestamp":1757451378757,"version":"3.40.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911309","type":"print"},{"value":"9783031911316","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91131-6_6","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T14:29:20Z","timestamp":1745764160000},"page":"157-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quasi-Linear Indistinguishability Obfuscation via\u00a0Mathematical Proofs of\u00a0Equivalence and\u00a0Applications"],"prefix":"10.1007","author":[{"given":"Yaohua","family":"Ma","sequence":"first","affiliation":[]},{"given":"Chenxin","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A.: Indistinguishability obfuscation from compact functional encryption. In: CRYPTO (2015)","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Sahai, A.: Indistinguishability obfuscation for turing machines: constant overhead and amortization. In: CRYPTO (2017)","DOI":"10.1007\/978-3-319-63715-0_9"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Fernando, R., Koppula, V., Sahai, A., Waters, B.: Output compression, MPC, and IO for turing machines. In: ASIACRYPT (2019)","DOI":"10.1007\/978-3-030-34578-5_13"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bentley, J.L., Saxe, J.B.: Decomposable searching problems i. Static-to-dynamic transformation. J. Algorithms 1(4), 301\u2013358 (1980)","DOI":"10.1016\/0196-6774(80)90015-2"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., et al.: Indistinguishability obfuscation for ram programs and succinct randomized encodings. SIAM J. Comput. (2018)","DOI":"10.1137\/15M1050963"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: ASIACRYPT (2013)","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"6_CR7","unstructured":"Boyle, E., Chung, K.M., Pass, R.: Oblivious parallel ram. In: TCC (2015)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Brodsky, M.F., Kalai, Y.T., Lombardi, A., Paneth, O.: SNARGs for monotone policy batch NP. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38545-2_9"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: Theory of Cryptography, pp. 468\u2013497 (2015)","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Chen, J., Wee, H.: Semi-adaptive attribute-based encryption and improved delegation for boolean formula. In: SCN (2014)","DOI":"10.1007\/978-3-319-10879-7_16"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Fernando, R., Shi, E., Soni, P., Vanjani, N., Waters, B.: Non-interactive anonymous router with quasi-linear router computation. In: TCC (2023)","DOI":"10.1007\/978-3-031-48621-0_3"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Freitag, C., Waters, B., Wu, D.J.: How to use (plain) witness encryption: registered ABE, flexible broadcast, and more. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38551-3_16"},{"key":"6_CR13","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: FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM (1986)","DOI":"10.1145\/6490.6503"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., et al.: Multi-input functional encryption. In: Eurocrypt (2014)","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Semi-adaptive security and bundling functionalities made generic and easy. In: TCC (2016)","DOI":"10.1007\/978-3-662-53644-5_14"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Goyal, V., Jain, A., O\u2019Neill, A.: Multi-input functional encryption with unbounded-message security. In: ASIACRYPT (2016)","DOI":"10.1007\/978-3-662-53890-6_18"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"H\u00c5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. (1999)","DOI":"10.1137\/S0097539793244708"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Hubacek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: ITCS (2015)","DOI":"10.1145\/2688073.2688105"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Jain, A., Jin, Z.: Indistinguishability obfuscation via mathematical proofs of equivalence. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1023\u20131034 (2022)","DOI":"10.1109\/FOCS54457.2022.00100"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Luo, J.: On the optimal succinctness and efficiency of functional encryption and attribute-based encryption. In: Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, 23\u201327 April 2023, Proceedings, Part III. Lecture Notes in Computer Science, vol. 14006, pp. 479\u2013510. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30620-4_16"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: STOC (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for turing machines with unbounded memory. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2015, pp. 419\u2013428 (2015). https:\/\/doi.org\/10.1145\/2746539.2746614","DOI":"10.1145\/2746539.2746614"},{"key":"6_CR25","unstructured":"Ma, Y., Dai, C., Shi, E.: Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications. Online full version of this paper. https:\/\/eprint.iacr.org\/2025\/307 (2025)"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/322123.322138","volume":"26","author":"N Pippenger","year":"1979","unstructured":"Pippenger, N., Fischer, M.J.: Relations among complexity measures. J. ACM 26(2), 361\u2013381 (1979)","journal-title":"J. ACM"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 475\u2013484. Association for Computing Machinery, New York (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 3\u20135 May 1976, Hershey, Pennsylvania, USA, pp. 196\u2013203. ACM (1976)","DOI":"10.1145\/800113.803649"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Waters, B., Wu, D.J.: Batch arguments for np and more from standard bilinear group assumptions. In: Advances in Cryptology - CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, 15\u201318 August 2022, Proceedings, Part II, pp. 433\u2013463 (2022)","DOI":"10.1007\/978-3-031-15979-4_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91131-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T14:29:38Z","timestamp":1745764178000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91131-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911309","9783031911316"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91131-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}