{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T01:13:00Z","timestamp":1779325980586,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"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-09396-x","type":"journal-article","created":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T22:02:36Z","timestamp":1621893756000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Simple and Generic Constructions of Succinct Functional Encryption"],"prefix":"10.1007","volume":"34","author":[{"given":"Fuyuki","family":"Kitagawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,24]]},"reference":[{"key":"9396_CR1","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Boneh, X. Boyen, Efficient lattice (H)IBE in the standard model, in Henri Gilbert, editor, EUROCRYPT\u00a02010, volume 6110 of LNCS, (Springer, Heidelberg, 2010), pp. 553\u2013572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"9396_CR2","doi-asserted-by":"crossref","unstructured":"P. Ananth, Z. Brakerski, G. Segev, V. Vaikuntanathan, From selective to adaptive security in functional encryption, in Rosario Gennaro and Matthew J.\u00a0B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II, volume 9216 of LNCS, (Springer, Heidelberg, 2015), pp. 657\u2013677","DOI":"10.1007\/978-3-662-48000-7_32"},{"key":"9396_CR3","doi-asserted-by":"crossref","unstructured":"P. Ananth, A. Cohen, A. Jain, Cryptography with updates, in Jean-S\u00e9bastien Coron and Jesper\u00a0Buus Nielsen, editors, EUROCRYPT\u00a02017, Part\u00a0II, volume 10211 of LNCS, (Springer, Heidelberg, 2017), pp. 445\u2013472","DOI":"10.1007\/978-3-319-56614-6_15"},{"key":"9396_CR4","doi-asserted-by":"crossref","unstructured":"G. Asharov, N. Ephraim, I. Komargodski, R. Pass, On the complexity of compressing obfuscation, in Hovav Shacham and Alexandra Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0III, volume 10993 of LNCS, (Springer, Heidelberg, 2018), pp. 753\u2013783","DOI":"10.1007\/978-3-319-96878-0_26"},{"issue":"2","key":"9396_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"B Applebaum","year":"2006","unstructured":"B. Applebaum, Y. Ishai, E. Kushilevitz, Computationally private randomizing polynomials and their applications. Computat. Complex. 15(2), 115\u2013162 (2006)","journal-title":"Computat. Complex."},{"key":"9396_CR6","doi-asserted-by":"crossref","unstructured":"P. Ananth, A. Jain, Indistinguishability obfuscation from compact functional encryption, in Rosario Gennaro and Matthew J.\u00a0B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0I, volume 9215 of LNCS, (Springer, Heidelberg, 2015), pp. 308\u2013326","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"9396_CR7","unstructured":"P. Ananth, A. Jain, A. Sahai, Indistinguishability obfuscation from functional encryption for simple functions. Cryptology ePrint Archive, Report 2015\/730 (2015). https:\/\/eprint.iacr.org\/2015\/730"},{"issue":"4","key":"9396_CR8","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s00145-010-9078-6","volume":"24","author":"D Boneh","year":"2011","unstructured":"D. Boneh, X. Boyen, Efficient selective identity-based encryption without random oracles. J. Cryptol. 24(4), 659\u2013693 (2011)","journal-title":"J. Cryptol."},{"key":"9396_CR9","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S.P. Vadhan, K. Yang, On the (im)possibility of obfuscating programs. J. ACM 59(2), 6:1\u20136:48 (2012)","DOI":"10.1145\/2160158.2160159"},{"key":"9396_CR10","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Goldwasser, I. Ivan, Functional signatures and pseudorandom functions, in Hugo Krawczyk, editor, PKC\u00a02014, volume 8383 of LNCS, (Springer, Heidelberg, 2014), pp. 501\u2013519","DOI":"10.1007\/978-3-642-54631-0_29"},{"issue":"2","key":"9396_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s00145-017-9261-0","volume":"31","author":"Z Brakerski","year":"2018","unstructured":"Z. Brakerski, I. Komargodski, G. Segev, Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions. J. Cryptol. 31(2), 434\u2013520 (2018)","journal-title":"J. Cryptol."},{"issue":"2","key":"9396_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00145-019-09337-9","volume":"33","author":"N Bitansky","year":"2020","unstructured":"N. Bitansky, R. Nishimaki, A. Passel\u00e8gue, D. Wichs, From cryptomania to obfustopia through secret-key functional encryption. J. Cryptol. 33(2), 357\u2013405 (2020)","journal-title":"J. Cryptol."},{"key":"9396_CR13","doi-asserted-by":"crossref","unstructured":"A. Banerjee, C. Peikert, A. Rosen, Pseudorandom functions and lattices, in David Pointcheval and Thomas Johansson, editors, EUROCRYPT\u00a02012, volume 7237 of LNCS, (Springer, Heidelberg, 2012), pp. 719\u2013737","DOI":"10.1007\/978-3-642-29011-4_42"},{"issue":"1","key":"9396_CR14","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00145-017-9255-y","volume":"31","author":"Z Brakerski","year":"2018","unstructured":"Z. Brakerski, G. Segev, Function-private functional encryption in the private-key setting. J. Cryptol. 31(1), 202\u2013225 (2018)","journal-title":"J. Cryptol."},{"key":"9396_CR15","doi-asserted-by":"crossref","unstructured":"D. Boneh, A. Sahai, B. Waters, Functional encryption: definitions and challenges, in Yuval Ishai, editor, TCC\u00a02011, volume 6597 of LNCS, (Springer, Heidelberg, 2011), pp. 253\u2013273","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"9396_CR16","doi-asserted-by":"crossref","unstructured":"N. Bitansky, V. Vaikuntanathan, Indistinguishability obfuscation from functional encryption. J. ACM 65(6), 39:1\u201339:37 (2018)","DOI":"10.1145\/3234511"},{"key":"9396_CR17","doi-asserted-by":"crossref","unstructured":"D. Boneh, B. Waters, Constrained pseudorandom functions and their applications, in Kazue Sako and Palash Sarkar, editors, ASIACRYPT\u00a02013, Part\u00a0II, volume 8270 of LNCS, (Springer, Heidelberg, 2013), pp. 280\u2013300","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"9396_CR18","doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation, in 28th ACM STOC, (ACM Press, May 1996), pp. 639\u2013648","DOI":"10.1145\/237814.238015"},{"issue":"4","key":"9396_CR19","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","volume":"25","author":"D Cash","year":"2012","unstructured":"D. Cash, D. Hofheinz, E. Kiltz, C. Peikert, Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25(4):601\u2013639 (2012)","journal-title":"J. Cryptol."},{"key":"9396_CR20","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, S. Garg, Identity-based encryption from the Diffie-Hellman assumption, in Jonathan Katz and Hovav Shacham, editors, CRYPTO\u00a02017, Part\u00a0I, volume 10401 of LNCS, (Springer, Heidelberg, 2017), pp. 537\u2013569","DOI":"10.1007\/978-3-319-63688-7_18"},{"key":"9396_CR21","doi-asserted-by":"crossref","unstructured":"S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts, David Chaum, Ronald\u00a0L. Rivest, and Alan\u00a0T. Sherman, editors, CRYPTO\u201982, (Plenum Press, New York, USA, 1982), pp. 205\u2013210","DOI":"10.1007\/978-1-4757-0602-4_19"},{"issue":"1","key":"9396_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U Feige","year":"1999","unstructured":"U. Feige, D. Lapidot, A. Shamir, Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput. 29(1), 1\u201328 (1999)","journal-title":"SIAM J. Comput."},{"key":"9396_CR23","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S.D. Gordon, V. Goyal, A. Jain, J. Katz, F.-H. Liu, A. Sahai, E. Shi, H.-S. Zhou, Multi-input functional encryption, in Phong\u00a0Q. Nguyen and Elisabeth Oswald, editors, EUROCRYPT\u00a02014, volume 8441 of LNCS, (Springer, Heidelberg, 2014), pp. 578\u2013602","DOI":"10.1007\/978-3-642-55220-5_32"},{"issue":"3","key":"9396_CR24","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters, Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9396_CR25","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"9396_CR26","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y.T. Kalai, R.A. Popa, V. Vaikuntanathan, N. Zeldovich, Reusable garbled circuits and succinct functional encryption, in Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, 45th ACM STOC, (ACM Press, 2013), pp. 555\u2013564","DOI":"10.1145\/2488608.2488678"},{"key":"9396_CR27","doi-asserted-by":"crossref","unstructured":"S. Garg, M. Mahmoody, A. Mohammed, When does functional encryption imply obfuscation? in Yael Kalai and Leonid Reyzin, editors, TCC\u00a02017, Part\u00a0I, volume 10677 of LNCS, (Springer, Heidelberg, 2017), pp. 82\u2013115","DOI":"10.1007\/978-3-319-70500-2_4"},{"key":"9396_CR28","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Srinivasan, Single-key to multi-key functional encryption with polynomial loss, in Martin Hirt and Adam\u00a0D. Smith, editors, TCC\u00a02016-B, Part\u00a0II, volume 9986 of LNCS, (Springer, Heidelberg, 2016), pp. 419\u2013442","DOI":"10.1007\/978-3-662-53644-5_16"},{"key":"9396_CR29","doi-asserted-by":"crossref","unstructured":"S. Gorbunov, V. Vaikuntanathan, H. Wee, Functional encryption with bounded collusions via multi-party computation, in Reihaneh Safavi-Naini and Ran Canetti, editors, CRYPTO\u00a02012, volume 7417 of LNCS, (Springer, Heidelberg, 2012), pp. 162\u2013179","DOI":"10.1007\/978-3-642-32009-5_11"},{"issue":"4","key":"9396_CR30","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9396_CR31","unstructured":"Y. Ishai, E. Kushilevitz, Randomizing polynomials: a new representation with applications to round-efficient secure computation, in 41st FOCS, (IEEE Computer Society Press, 2000), pp. 294\u2013304"},{"key":"9396_CR32","unstructured":"F. Kitagawa, R. Nishimaki, K. Tanaka, From single-key to collusion-resistant secret-key functional encryption by leveraging succinctness. Cryptology ePrint Archive, Report 2017\/638 (2017). https:\/\/eprint.iacr.org\/2017\/638"},{"key":"9396_CR33","unstructured":"F. Kitagawa, R. Nishimaki, K. Tanaka, Indistinguishability obfuscation for all circuits from secret-key functional encryption. Cryptology ePrint Archive, Report 2017\/361 (2017). https:\/\/eprint.iacr.org\/2017\/361"},{"key":"9396_CR34","doi-asserted-by":"crossref","unstructured":"F. Kitagawa, R. Nishimaki, K. Tanaka, Obfustopia built on secret-key functional encryption, in Jesper\u00a0Buus Nielsen and Vincent Rijmen, editors, EUROCRYPT\u00a02018, Part\u00a0II, volume 10821 of LNCS, (Springer, Heidelberg, 2018), pp. 603\u2013648","DOI":"10.1007\/978-3-319-78375-8_20"},{"key":"9396_CR35","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval, in Bart Preneel, editor, EUROCRYPT\u00a02000, volume 1807 of LNCS, (Springer, Heidelberg, 2000), pp. 104\u2013121","DOI":"10.1007\/3-540-45539-6_9"},{"key":"9396_CR36","doi-asserted-by":"crossref","unstructured":"A. Kiayias, S. Papadopoulos, N. Triandopoulos, T. Zacharias, Delegatable pseudorandom functions and applications, in Ahmad-Reza Sadeghi, Virgil\u00a0D. Gligor, and Moti Yung, editors, ACM CCS 2013, (ACM Press, 2013), pp. 669\u2013684","DOI":"10.1145\/2508859.2516668"},{"issue":"2","key":"9396_CR37","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/s00145-019-09327-x","volume":"33","author":"I Komargodski","year":"2020","unstructured":"I. Komargodski, G. Segev, From minicrypt to obfustopia via private-key functional encryption. J. Cryptol. 33(2), 406\u2013458 (2020)","journal-title":"J. Cryptol."},{"key":"9396_CR38","doi-asserted-by":"crossref","unstructured":"B. Li, D. Micciancio, Compactness vs collusion resistance in functional encryption, in Martin Hirt and Adam\u00a0D. Smith, editors, TCC\u00a02016-B, Part\u00a0II, volume 9986 of LNCS, (Springer, Heidelberg, 2016), pp. 443\u2013468","DOI":"10.1007\/978-3-662-53644-5_17"},{"key":"9396_CR39","doi-asserted-by":"crossref","unstructured":"H. Lin, R. Pass, K. Seth, S. Telang, Indistinguishability obfuscation with non-trivial efficiency, in Chen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, and Bo-Yin Yang, editors, PKC\u00a02016, Part\u00a0II, volume 9615 of LNCS, (Springer, Heidelberg, 2016), pp. 447\u2013462","DOI":"10.1007\/978-3-662-49387-8_17"},{"key":"9396_CR40","doi-asserted-by":"crossref","unstructured":"H. Lin, S. Tessaro, Indistinguishability obfuscation from trilinear maps and block-wise local PRGs. Cryptology ePrint Archive, Report 2017\/250 (2017). https:\/\/eprint.iacr.org\/2017\/250","DOI":"10.1007\/978-3-319-63688-7_21"},{"issue":"2","key":"9396_CR41","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M Naor","year":"2004","unstructured":"M. Naor, O. Reingold, Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231\u2013262 (2004)","journal-title":"J. ACM"},{"key":"9396_CR42","unstructured":"A. O\u2019Neill, Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010\/556 (2010). https:\/\/eprint.iacr.org\/2010\/556"},{"key":"9396_CR43","doi-asserted-by":"crossref","unstructured":"J. Rompel, One-way functions are necessary and sufficient for secure signatures, in 22nd ACM STOC, (ACM Press, 1990), pp. 387\u2013394","DOI":"10.1145\/100216.100269"},{"key":"9396_CR44","doi-asserted-by":"crossref","unstructured":"A. Shamir, Identity-based cryptosystems and signature schemes, in G.\u00a0R. Blakley and David Chaum, editors, CRYPTO\u201984, volume 196 of LNCS, (Springer, Heidelberg, 1984), pp. 47\u201353","DOI":"10.1007\/3-540-39568-7_5"},{"key":"9396_CR45","doi-asserted-by":"crossref","unstructured":"A. Sahai, H. Seyalioglu, Worry-free encryption: functional encryption with public keys, in Ehab Al-Shaer, Angelos\u00a0D. Keromytis, and Vitaly Shmatikov, editors, ACM CCS 2010, (ACM Press, 2010), pp. 463\u2013472","DOI":"10.1145\/1866307.1866359"},{"key":"9396_CR46","doi-asserted-by":"crossref","unstructured":"A. Sahai, B. Waters, How to use indistinguishability obfuscation: deniable encryption, and more, in David\u00a0B. Shmoys, editor, 46th ACM STOC, (ACM Press, 2014), pp. 475\u2013484","DOI":"10.1145\/2591796.2591825"},{"key":"9396_CR47","unstructured":"A.C.-C. Yao, Theory and applications of trapdoor functions (extended abstract), in 23rd FOCS, (IEEE Computer Society Press, 1982), pp. 80\u201391"},{"key":"9396_CR48","unstructured":"A.C.-C. Yao, How to generate and exchange secrets (extended abstract), in 27th FOCS, (IEEE Computer Society Press, 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-09396-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09396-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09396-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T19:08:28Z","timestamp":1629227308000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09396-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,24]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["9396"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09396-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,24]]},"assertion":[{"value":"5 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"25"}}