{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:27:14Z","timestamp":1760574434786,"version":"build-2065373602"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T00:00:00Z","timestamp":1750809600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T00:00:00Z","timestamp":1750809600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10623-025-01671-3","type":"journal-article","created":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T10:16:17Z","timestamp":1750846577000},"page":"4209-4221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A simple inner-product functional encryption scheme from the inverse-DDH assumption"],"prefix":"10.1007","volume":"93","author":[{"given":"Rajeev Anand","family":"Sahu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim Jean-Pierre","family":"Barthel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u0103zvan","family":"Ro\u015fie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,25]]},"reference":[{"key":"1671_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla M., Bourse F., De Caro A., Pointcheval D.: Simple functional encryption schemes for inner products. In: Katz J. (ed.), PKC\u00a02015. LNCS, March\u2013April 2015, vol. 9020, pp. 733\u2013751. Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-46447-2_33"},{"key":"1671_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht M.R., Farshim P., Hofheinz D., Larraia E., Paterson K.G.: Multilinear maps from obfuscation. In: Kushilevitz E., Malkin T. (eds.), TCC 2016-A, Part I. LNCS, 2016, vol. 9562, pp. 446\u2013473. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49096-9_19"},{"key":"1671_CR3","doi-asserted-by":"crossref","unstructured":"Ananth P., Jain A.: Indistinguishability obfuscation from compact functional encryption. In: Gennaro R., Robshaw M.J.B. (eds.), CRYPTO 2015, Part I. LNCS, August 2015, vol. 9215, pp. 308\u2013326. Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"1671_CR4","doi-asserted-by":"crossref","unstructured":"Baltico C.E.Z., Catalano D., Fiore D., Gay R.: Practical functional encryption for quadratic functions with applications to predicate encryption. In: Katz J.S.H. (ed.) CRYPTO 2017, Part I. LNCS, 2017, vol. 10401, pp. 67\u201398. Springer, Heidelberg (2017).","DOI":"10.1007\/978-3-319-63688-7_3"},{"key":"1671_CR5","doi-asserted-by":"crossref","unstructured":"Bao F., Deng R.H., Zhu H.: Variations of Diffie\u2013Hellman problem. In: Qing S., Gollmann D., Zhou J. (eds.) ICICS 03. LNCS, 2003, vol. 2836, pp. 301\u2013312. Springer, Heidelberg (2003).","DOI":"10.1007\/978-3-540-39927-8_28"},{"key":"1671_CR6","doi-asserted-by":"crossref","unstructured":"Benhamouda F., Bourse F., Lipmaa H.: CCA-secure inner-product functional encryption from projective hash functions. In: Fehr S. (ed.) PKC 2017, Part II. LNCS, 2017, vol. 10175, pp. 36\u201366. Springer, Heidelberg (2017).","DOI":"10.1007\/978-3-662-54388-7_2"},{"key":"1671_CR7","doi-asserted-by":"crossref","unstructured":"Bishop A., Jain A., Kowalczyk L.: Function-hiding inner product encryption. In: Iwata T., Cheon J.H. (eds.), ASIACRYPT\u00a02015, Part\u00a0I. LNCS, November\u2013December 2015, vol. 9452, pp. 470\u2013491. Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-48797-6_20"},{"key":"1671_CR8","doi-asserted-by":"crossref","unstructured":"Bitansky N., Vaikuntanathan V.: Indistinguishability obfuscation from functional encryption. In: Guruswami V. (ed.) 56th FOCS, October 2015, pp. 171\u2013190. IEEE Computer Society Press (2015).","DOI":"10.1109\/FOCS.2015.20"},{"key":"1671_CR9","doi-asserted-by":"crossref","unstructured":"Boneh D., Gentry C., Gorbunov S., Halevi S., Nikolaenko V., Segev G., Vaikuntanathan V., Vinayagamurthy D.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen P.Q., Oswald E. (eds.) EUROCRYPT 2014. LNCS, 2014, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014).","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"1671_CR10","doi-asserted-by":"crossref","unstructured":"Boneh D., Sahai A., Waters B.: Functional encryption: definitions and challenges. In: Ishai Y. (ed.) TCC 2011. LNCS, 2011, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011).","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"1671_CR11","doi-asserted-by":"crossref","unstructured":"Boyle E., Goldwasser S., Ivan I.: Functional signatures and pseudorandom functions. In: Krawczyk H. (ed.) PKC 2014. LNCS, 2014, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014).","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"1671_CR12","doi-asserted-by":"crossref","unstructured":"Brakerski Z., Komargodski I., Segev G.: Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions. In: Fischlin M., Coron J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, 2016, vol. 9666, pp. 852\u2013880. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49896-5_30"},{"key":"1671_CR13","doi-asserted-by":"crossref","unstructured":"Castagnos G., Laguillaumie F., Tucker I.: Practical fully secure unrestricted inner product functional encryption modulo p. In: Peyrin T., Galbraith S. (eds.) ASIACRYPT 2018, Part II. LNCS, 2018, vol. 11273, pp. 733\u2013764. Springer, Heidelberg (2018).","DOI":"10.1007\/978-3-030-03329-3_25"},{"key":"1671_CR14","doi-asserted-by":"crossref","unstructured":"Datta P., Dutta R., Mukhopadhyay S.: Functional encryption for inner product with full function privacy. In: Cheng C.-M., Chung K.-M., Persiano G., Yang B.-Y. (eds.) PKC 2016, Part I. LNCS, 2016, vol. 9614, pp. 164\u2013195. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49384-7_7"},{"key":"1671_CR15","doi-asserted-by":"crossref","unstructured":"Escala A., Herold G., Kiltz E., R\u00e0fols C., Villar J.: An algebraic framework for Diffie\u2013Hellman assumptions. In: Canetti R., Garay J.A. (eds.) CRYPTO 2013, Part II. LNCS, 2013, vol. 8043, pp. 129\u2013147. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"1671_CR16","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 FOCS, October 2013, pp. 40\u201349. IEEE Computer Society Press (2013).","DOI":"10.1109\/FOCS.2013.13"},{"key":"1671_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Kalai Y.T., Popa R.A., Vaikuntanathan V., Zeldovich N.: How to run Turing machines on encrypted data. In: Canetti R., Garay J.A. (eds.): CRYPTO 2013, Part II. LNCS, 2013, vol. 8043, pp. 536\u2013553. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-642-40084-1_30"},{"key":"1671_CR18","doi-asserted-by":"crossref","unstructured":"Hofheinz D., Jager T.: Verifiable random functions from standard assumptions. In: Kushilevitz E., Malkin T. (eds.) TCC 2016-A, Part I. LNCS, 2016, vol. 9562, pp. 336\u2013362. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49096-9_14"},{"key":"1671_CR19","unstructured":"Jain A., Lin H., Sahai A.: Indistinguishability obfuscation from well-founded assumptions. Cryptology ePrint Archive, Report 2020\/1003 (2020). https:\/\/eprint.iacr.org\/2020\/1003."},{"key":"1671_CR20","doi-asserted-by":"crossref","unstructured":"Komargodski I., Segev G.: From minicrypt to obfustopia via private-key functional encryption. In: Coron J.-S., Nielsen J.B. (eds.) EUROCRYPT\u00a02017, Part\u00a0I. LNCS, April\u2013May 2017, vol. 10210, pp. 122\u2013151. Springer, Heidelberg (2017).","DOI":"10.1007\/978-3-319-56620-7_5"},{"key":"1671_CR21","doi-asserted-by":"crossref","unstructured":"Lin H.: Indistinguishability obfuscation from constant-degree graded encoding schemes. In: Fischlin M., Coron J.-S. (eds.) EUROCRYPT 2016, Part I. LNCS, 2016, vol. 9665, pp. 28\u201357. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49890-3_2"},{"key":"1671_CR22","doi-asserted-by":"crossref","unstructured":"Lin H., Pass R., Seth K., Telang S.: Indistinguishability obfuscation with non-trivial efficiency. In: Cheng C.-Mou., Chung K.-M., Persiano G., Yang B.-Y. (eds.) PKC 2016, Part II. LNCS, 2016, vol. 9615, pp. 447\u2013462. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49387-8_17"},{"key":"1671_CR23","unstructured":"O\u2019Neill A.: Definitional issues in functional encryption. Cryptology ePrint Archive (2010)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01671-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01671-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01671-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T07:28:45Z","timestamp":1760513325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01671-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,25]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1671"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01671-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,6,25]]},"assertion":[{"value":"29 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}