{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:30:48Z","timestamp":1649046648643},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"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":["J Cryptol"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00145-021-09400-4","type":"journal-article","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T20:02:15Z","timestamp":1625601735000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness"],"prefix":"10.1007","volume":"34","author":[{"given":"Qipeng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"9400_CR1","doi-asserted-by":"crossref","unstructured":"P. Ananth, A. Jain, Indistinguishability obfuscation from compact functional encryption, in Annual Cryptology Conference. (Springer, 2015), pp. 308\u2013326","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"9400_CR2","doi-asserted-by":"crossref","unstructured":"P. Ananth, A. Jain, A. Sahai, Achieving compactness generically: Indistinguishability obfuscation from non-compact functional encryption. Cryptology ePrint Archive, Report 2015\/730, 2015. http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"9400_CR3","unstructured":"T. Abbott, D. Kane, P. Valiant, On algorithms for nash equilibria, 2004"},{"key":"9400_CR4","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang, On the (im) possibility of obfuscating programs, in Annual International Cryptology Conference. (Springer, 2001), pp. 1\u201318","DOI":"10.1007\/3-540-44647-8_1"},{"key":"9400_CR5","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. (Springer, Berlin, 2015), pp. 401\u2013427","DOI":"10.1007\/978-3-662-46497-7_16"},{"key":"9400_CR6","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, A. Rosen, On the cryptographic hardness of finding a nash equilibrium, in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). (IEEE, 2015), pp. 1480\u20131498","DOI":"10.1109\/FOCS.2015.94"},{"key":"9400_CR7","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, D. Wichs, Perfect Structure on the Edge of Chaos. (Springer, Berlin, 2016), pp 474\u2013502","DOI":"10.1007\/978-3-662-49096-9_20"},{"key":"9400_CR8","doi-asserted-by":"crossref","unstructured":"M. Bellare, I. Stepanovs, S. Tessaro, Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation. (Springer, Berlin, 2014), pp. 102\u2013121","DOI":"10.1007\/978-3-662-45608-8_6"},{"key":"9400_CR9","doi-asserted-by":"crossref","unstructured":"D. Boneh, A. Sahai, B. Waters, Functional encryption: Definitions and challenges, in Theory of Cryptography Conference. (Springer, 2011), pp. 253\u2013273","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"9400_CR10","doi-asserted-by":"crossref","unstructured":"N. Bitansky, V. Vaikuntanathan, Indistinguishability obfuscation from functional encryption, in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). (IEEE, 2015), pp. 171\u2013190","DOI":"10.1109\/FOCS.2015.20"},{"key":"9400_CR11","doi-asserted-by":"crossref","unstructured":"D. Boneh, M. Zhandry, Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation. (Springer, Berlin, 2014), pp. 480\u2013499","DOI":"10.1007\/978-3-662-44371-2_27"},{"key":"9400_CR12","doi-asserted-by":"crossref","unstructured":"M. Bun, M. Zhandry, Order-Revealing Encryption and the Hardness of Private Learning. (Springer, Berlin, 2016), pp. 176\u2013206","DOI":"10.1007\/978-3-662-49096-9_8"},{"key":"9400_CR13","doi-asserted-by":"crossref","unstructured":"R. Canetti, H. Lin, S. Tessaro, V. Vaikuntanathan, Obfuscation of Probabilistic Circuits and Applications. (Springer, Berlin, 2015), pp. 468\u2013497","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"9400_CR14","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, Candidate multilinear maps from ideal lattices, in Annual International Conference on the Theory and Applications of Cryptographic Techniques. (Springer, 2013), pp. 1\u201317","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"9400_CR15","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters, Candidate indistinguishability obfuscation and functional encryption for all circuits, in Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS \u201913, Washington, DC, USA, 2013. IEEE Computer Society, pp. 40\u201349","DOI":"10.1109\/FOCS.2013.13"},{"key":"9400_CR16","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Zhandry, Functional Encryption Without Obfuscation. (Springer, Berlin, 2016), pp. 480\u2013511","DOI":"10.1007\/978-3-662-49099-0_18"},{"key":"9400_CR17","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. Journal of the ACM (JACM), 33(4):792\u2013807, 1986","DOI":"10.1145\/6490.6503"},{"key":"9400_CR18","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, A. Sahai, B. Waters, Witness encryption and its applications, in Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC \u201913, New York, NY, USA, 2013. ACM, pp. 467\u2013476","DOI":"10.1145\/2488608.2488667"},{"key":"9400_CR19","doi-asserted-by":"crossref","unstructured":"C. Gentry, A.B. Lewko, A. Sahai, B. Waters, Indistinguishability obfuscation from the multilinear subgroup elimination assumption, in Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), FOCS \u201915, Washington, DC, USA, 2015. IEEE Computer Society, pp. 151\u2013170","DOI":"10.1109\/FOCS.2015.19"},{"key":"9400_CR20","doi-asserted-by":"crossref","unstructured":"S. Garg, O. Pandey, A. Srinivasan, Revisiting the cryptographic hardness of finding a nash equilibrium, in Annual Cryptology Conference. (Springer, 2016), pp. 579\u2013604","DOI":"10.1007\/978-3-662-53008-5_20"},{"key":"9400_CR21","unstructured":"S. Garg, O. Pandey, A. Srinivasan, M. Zhandry, Breaking the sub-exponential barrier in obfustopia. Technical report, Cryptology ePrint Archive, Report 2016\/102, 2016. http:\/\/eprint.iacr.org\/2016\/102, 2016"},{"key":"9400_CR22","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Srinivasan, Single-key to multi-key functional encryption with polynomial loss, in Theory of Cryptography Conference. (Springer, 2016), pp. 419\u2013442","DOI":"10.1007\/978-3-662-53644-5_16"},{"key":"9400_CR23","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y.T. Kalai, Cryptographic Assumptions: A Position Paper. (Springer, Berlin, 2016), pp. 505\u2013522","DOI":"10.1007\/978-3-662-49096-9_21"},{"key":"9400_CR24","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, M. Zhandry, How to Generate and Use Universal Samplers. (Springer, Berlin, 2016), pp. 715\u2013744","DOI":"10.1007\/978-3-662-53890-6_24"},{"key":"9400_CR25","doi-asserted-by":"crossref","unstructured":"P. Hubacek, D. Wichs, On the communication complexity of secure function evaluation with long output, in Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS \u201915, New York, NY, USA, 2015. ACM, pp. 163\u2013172","DOI":"10.1145\/2688073.2688105"},{"key":"9400_CR26","unstructured":"R. Impagliazzo, A personal view of average-case complexity, in Structure in Complexity Theory Conference, 1995. Proceedings of Tenth Annual IEEE. (IEEE, 1995), pp. 134\u2013147"},{"key":"9400_CR27","doi-asserted-by":"crossref","unstructured":"I.\u00a0Komargodski, T.\u00a0Moran, M.\u00a0Naor, R.\u00a0Pass, A.\u00a0Rosen, E.\u00a0Yogev, One-way functions and (im)perfect obfuscation, in 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), 2014, pp. 374\u2013383","DOI":"10.1109\/FOCS.2014.47"},{"key":"9400_CR28","doi-asserted-by":"crossref","unstructured":"I. Komargodski, G. Segev, From minicrypt to obfustopia via private-key functional encryption, in Annual International Conference on the Theory and Applications of Cryptographic Techniques. (Springer, 2017), pp. 122\u2013151","DOI":"10.1007\/978-3-319-56620-7_5"},{"key":"9400_CR29","doi-asserted-by":"crossref","unstructured":"B. Li, D. Micciancio, Compactness vs collusion resistance in functional encryption, in Theory of Cryptography Conference. (Springer, 2016), pp. 443\u2013468","DOI":"10.1007\/978-3-662-53644-5_17"},{"key":"9400_CR30","doi-asserted-by":"crossref","unstructured":"Y. Lindell, B. Pinkas, A proof of security of yao?s protocol for two-party computation. Journal of Cryptology, 22(2):161\u2013188, 2009","DOI":"10.1007\/s00145-008-9036-8"},{"key":"9400_CR31","doi-asserted-by":"crossref","unstructured":"M. Naor, On Cryptographic Assumptions and Challenges. (Springer, Berlin, 2003), pp. 96\u2013109","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"9400_CR32","unstructured":"A. O\u2019Neill, Definitional issues in functional encryption, in IACR Cryptology ePrint Archive, 2010:556, 2010"},{"key":"9400_CR33","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou, On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and system Sciences, 48(3):498\u2013532, 1994","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"9400_CR34","doi-asserted-by":"crossref","unstructured":"A. Sahai, B. Waters, Fuzzy identity-based encryption, in Annual International Conference on the Theory and Applications of Cryptographic Techniques. (Springer, 2005), pp. 457\u2013473","DOI":"10.1007\/11426639_27"},{"key":"9400_CR35","doi-asserted-by":"crossref","unstructured":"A. Sahai, B. Waters, How to use indistinguishability obfuscation: deniable encryption, and more, in Proceedings of the 46th Annual ACM Symposium on Theory of Computing. (ACM, 2014), pp. 475\u2013484","DOI":"10.1145\/2591796.2591825"},{"key":"9400_CR36","unstructured":"A.C.-C. Yao, How to generate and exchange secrets, in 27th Annual Symposium on Foundations of Computer Science, 1986. (IEEE, 1986), pp. 162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09400-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09400-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09400-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T19:11:06Z","timestamp":1629227466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09400-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["9400"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09400-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"12 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"35"}}