{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:52:29Z","timestamp":1783788749489,"version":"3.55.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"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":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s11390-024-3670-y","type":"journal-article","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:34:03Z","timestamp":1752140043000},"page":"921-938","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Function-Hiding Inner Product Functional Encryption and Its Application to Fine-Grained Data Sharing"],"prefix":"10.1007","volume":"40","author":[{"given":"Ming","family":"Wan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Da-Wu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gong-Yu","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,9]]},"reference":[{"key":"3670_CR1","unstructured":"O\u2019Neill A. Definitional issues in functional encryption. Cryptology ePrint Archive, Paper 2010\/556. https:\/\/eprint.iacr.org\/2010\/556, May 2025."},{"key":"3670_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Proc. the 8th Theory of Cryptography Conference","author":"D Boneh","year":"2011","unstructured":"Boneh D, Sahai A, Waters B. Functional encryption: Definitions and challenges. In Proc. the 8th Theory of Cryptography Conference, Mar. 2011, pp.253\u2013273. DOI: https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16."},{"key":"3670_CR3","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-64840-4_16","volume-title":"Proc. the 26th International Conference on the Theory and Application of Cryptology and Information Security","author":"M Abdalla","year":"2020","unstructured":"Abdalla M, Catalano D, Gay R, Ursu B. Inner-product functional encryption with fine-grained access control. In Proc. the 26th International Conference on the Theory and Application of Cryptology and Information Security, Dec. 2020, pp.467\u2013497. DOI: https:\/\/doi.org\/10.1007\/978-3-030-64840-4_16."},{"key":"3670_CR4","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-030-77870-5_18","volume-title":"Proc. the 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Q Lai","year":"2021","unstructured":"Lai Q, Liu F H, Wang Z. New lattice two-stage sampling technique and its applications to functional encryption \u2014 Stronger security and smaller ciphertexts. In Proc. the 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Oct. 2021, pp.498\u2013527. DOI: https:\/\/doi.org\/10.1007\/978-3-030-77870-5_18."},{"key":"3670_CR5","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-662-46447-2_33","volume-title":"Proc. the 18th IACR International Conference on Practice and Theory in Public-Key Cryptography","author":"M Abdalla","year":"2015","unstructured":"Abdalla M, Bourse F, de Caro A, Pointcheval D. Simple functional encryption schemes for inner products. In Proc. the 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Mar. 30\u2013Apr. 1, 2015, pp.733\u2013751. DOI: https:\/\/doi.org\/10.1007\/978-3-662-46447-2_33."},{"key":"3670_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-53015-3_12","volume-title":"Proc. the 36th Annual International Cryptology Conference","author":"S Agrawal","year":"2016","unstructured":"Agrawal S, Libert B, Stehl\u00e9 D. Fully secure functional encryption for inner products, from standard assumptions. In Proc. the 36th Annual International Cryptology Conference, Aug. 2016, pp.333\u2013362. DOI: https:\/\/doi.org\/10.1007\/978-3-662-53015-3_12."},{"key":"3670_CR7","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-98113-0_29","volume-title":"Proc. the 11th International Conference on Security and Cryptography for Networks","author":"S Kim","year":"2018","unstructured":"Kim S, Lewi K, Mandal A, Montgomery H, Roy A, Wu D J. Function-hiding inner product encryption is practical. In Proc. the 11th International Conference on Security and Cryptography for Networks, Sept. 2018, pp.544\u2013562. DOI: https:\/\/doi.org\/10.1007\/978-3-319-98113-0_29."},{"issue":"8","key":"3670_CR8","doi-asserted-by":"publisher","first-page":"4169","DOI":"10.3390\/s23084169","volume":"23","author":"D H Ryu","year":"2023","unstructured":"Ryu D H, Jeon S Y, Hong J, Lee M K. Efficient Lp distance computation using function-hiding inner product encryption for privacy-preserving anomaly detection. Sensors, 2023, 23(8): 4169. DOI: https:\/\/doi.org\/10.3390\/s23084169.","journal-title":"Sensors"},{"key":"3670_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/GLOBE-COM42002.2020.9322502","volume-title":"Proc. the 2020 IEEE Global Communications Conference","author":"Y Zheng","year":"2020","unstructured":"Zheng Y, Lu R. Efficient privacy-preserving similarity range query based on pre-computed distances in eHealthcare. In Proc. the 2020 IEEE Global Communications Conference, Dec. 2020, pp.1\u20136. DOI: https:\/\/doi.org\/10.1109\/GLOBE-COM42002.2020.9322502."},{"key":"3670_CR10","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-662-48797-6_20","volume-title":"Proc. the 21st International Conference on the Theory and Application of Cryptology and Information Security","author":"A Bishop","year":"2015","unstructured":"Bishop A, Jain A, Kowalczyk L. Function-hiding inner product encryption. In Proc. the 21st International Conference on the Theory and Application of Cryptology and Information Security, Nov. 29\u2013Dec. 3, 2015, pp.470\u2013491. DOI: https:\/\/doi.org\/10.1007\/978-3-662-48797-6_20."},{"key":"3670_CR11","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-49384-7_7","volume-title":"Proc. the 19th IACR International Conference on Practice and Theory in Public-Key Cryptography","author":"P Datta","year":"2016","unstructured":"Datta P, Dutta R, Mukhopadhyay S. Functional encryption for inner product with full function privacy. In Proc. the 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Mar. 2016, pp.164\u2013195. DOI: https:\/\/doi.org\/10.1007\/978-3-662-49384-7_7."},{"key":"3670_CR12","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-319-45871-7_24","volume-title":"Proc. the 19th International Conference on Information Security","author":"J Tomida","year":"2016","unstructured":"Tomida J, Abe M, Okamoto T. Efficient functional encryption for inner-product values with full-hiding security. In Proc. the 19th International Conference on Information Security, Sept. 2016, pp.408\u2013425. DOI: https:\/\/doi.org\/10.1007\/978-3-319-45871-7_24."},{"key":"3670_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/2090236.2090262","volume-title":"Proc. the 3rd Innovations in Theoretical Computer Science Conference","author":"Z Brakerski","year":"2012","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. In Proc. the 3rd Innovations in Theoretical Computer Science Conference, Jan. 2012, pp.309\u2013325. DOI: https:\/\/doi.org\/10.1145\/2090236.2090262."},{"key":"3670_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Proc. the 33rd Annual Cryptology Conference","author":"C Gentry","year":"2013","unstructured":"Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Proc. the 33rd Annual Cryptology Conference, Aug. 2013, pp.75\u201392. DOI: https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5."},{"key":"3670_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-1-4612-0667-5_9","volume-title":"Breakthroughs in Statistics","author":"I J Good","year":"1997","unstructured":"Good I J. Introduction to Cooley and Tukey (1965) an algorithm for the machine calculation of complex Fourier series. In Breakthroughs in Statistics, Kotz S, Johnson N L (eds.), Springer, 1997, pp.201\u2013216. DOI: https:\/\/doi.org\/10.1007\/978-1-4612-0667-5_9."},{"issue":"4","key":"3670_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux A. A one round protocol for tripartite diffie-Hellman. Journal of Cryptology, 2004, 17(4): 263\u2013276. DOI: https:\/\/doi.org\/10.1007\/s00145-004-0312-y.","journal-title":"Journal of Cryptology"},{"key":"3670_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Proc. the 21st Annual International Cryptology Conference","author":"D Boneh","year":"2001","unstructured":"Boneh D, Franklin M. Identity-based encryption from the Weil pairing. In Proc. the 21st Annual International Cryptology Conference, Aug. 2001, pp.213\u2013229. DOI: https:\/\/doi.org\/10.1007\/3-540-44647-8_13."},{"key":"3670_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Proc. the 24th Annual International Cryptology Conference","author":"D Boneh","year":"2004","unstructured":"Boneh D, Boyen X, Shacham H. Short group signatures. In Proc. the 24th Annual International Cryptology Conference, Aug. 2004, pp.41\u201355. DOI: https:\/\/doi.org\/10.1007\/978-3-540-28628-8_3."},{"key":"3670_CR19","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Proc. the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"D Boneh","year":"2005","unstructured":"Boneh D, Boyen X, Goh E J. Hierarchical identity based encryption with constant size ciphertext. In Proc. the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2005, pp.440\u2013456. DOI: https:\/\/doi.org\/10.1007\/11426639_26."},{"issue":"2","key":"3670_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"V I Nechaev","year":"1994","unstructured":"Nechaev V I. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 1994, 55(2): 165\u2013172. DOI: https:\/\/doi.org\/10.1007\/BF02113297.","journal-title":"Mathematical Notes"},{"key":"3670_CR21","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Proc. the International Conference on the Theory and Application of Cryptographic Techniques","author":"V Shoup","year":"1997","unstructured":"Shoup V. Lower bounds for discrete logarithms and related problems. In Proc. the International Conference on the Theory and Application of Cryptographic Techniques, May 1997, pp.256\u2013266. DOI: https:\/\/doi.org\/10.1007\/3-540-69053-0_18."},{"key":"3670_CR22","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-34618-8_17","volume-title":"Proc. the 25th International Conference on the Theory and Application of Cryptology and Information Security","author":"J Bartusek","year":"2019","unstructured":"Bartusek J, Carmer B, Jain A, Jin Z, Lepoint T, Ma F, Malkin T, Malozemoff A J, Raykova M. Public-key function-private hidden vector encryption (and more). In Proc. the 25th International Conference on the Theory and Application of Cryptology and Information Security, Dec. 2019, pp.489\u2013519. DOI: https:\/\/doi.org\/10.1007\/978-3-030-34618-8_17."},{"issue":"4","key":"3670_CR23","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J T Schwartz","year":"1980","unstructured":"Schwartz J T. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 1980, 27(4): 701\u2013717. DOI: https:\/\/doi.org\/10.1145\/322217.322225.","journal-title":"Journal of the ACM"},{"key":"3670_CR24","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Proc. the Eurosam 1979, An International Symposium on Symbolic and Algebraic Manipulation","author":"R Zippel","year":"1979","unstructured":"Zippel R. Probabilistic algorithms for sparse polynomials. In Proc. the Eurosam 1979, An International Symposium on Symbolic and Algebraic Manipulation, Jun. 1979, pp.216\u2013226. DOI: https:\/\/doi.org\/10.1007\/3-540-09519-5_73."},{"key":"3670_CR25","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-030-03810-6_20","volume-title":"Proc. the 16th International Conference on Theory of Cryptography Conference","author":"J Bartusek","year":"2018","unstructured":"Bartusek J, Guan J, Ma F, Zhandry M. Return of GGH15: Provable security against zeroizing attacks. In Proc. the 16th International Conference on Theory of Cryptography Conference, Nov. 2018, pp.544\u2013574. DOI: https:\/\/doi.org\/10.1007\/978-3-030-03810-6_20."},{"key":"3670_CR26","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-662-49896-5_27","volume-title":"Proc. the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques","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 Proc. the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2016, pp.764\u2013791. DOI: https:\/\/doi.org\/10.1007\/978-3-662-49896-5_27."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-024-3670-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-024-3670-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-024-3670-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T02:23:55Z","timestamp":1757211835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-024-3670-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["3670"],"URL":"https:\/\/doi.org\/10.1007\/s11390-024-3670-y","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]},"assertion":[{"value":"11 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Conflict of Interest The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}]}}