{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T06:03:34Z","timestamp":1771913014722,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642363610","type":"print"},{"value":"9783642363627","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36362-7_15","type":"book-chapter","created":{"date-parts":[[2013,2,4]],"date-time":"2013-02-04T13:35:17Z","timestamp":1359984917000},"page":"235-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Improved (Hierarchical) Inner-Product Encryption from Lattices"],"prefix":"10.1007","author":[{"given":"Keita","family":"Xagawa","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s00145-010-9060-3","volume":"24","author":"M. Abdalla","year":"2011","unstructured":"Abdalla, M., Birkett, J., Catalano, D., Dent, A.W., Malone-Lee, J., Neven, G., Schuldt, J.C.N., Smart, N.P.: Wildcarded identity-based encryption. Journal of Cryptology\u00a024(1), 42\u201382 (2011), combined and extended of two papers [2, 11]","journal-title":"Journal of Cryptology"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/11787006_26","volume-title":"Automata, Languages and Programming","author":"M. Abdalla","year":"2006","unstructured":"Abdalla, M., Catalano, D., Dent, A.W., Malone-Lee, J., Neven, G., Smart, N.P.: Identity-Based Encryption Gone Wild. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol.\u00a04052, pp. 300\u2013311. Springer, Heidelberg (2006), the full version is available at \n                      http:\/\/eprint.iacr.org\/2006\/30"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-33481-8_7","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2012","author":"M. Abdalla","year":"2012","unstructured":"Abdalla, M., De Caro, A., Mochetti, K.: Lattice-Based Hierarchical Inner Product Encryption. In: Hevia, A., Neven, G. (eds.) LATINCRYPT 2012. LNCS, vol.\u00a07533, pp. 121\u2013138. Springer, Heidelberg (2012)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert (ed.) [27], pp. 553\u2013572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boyen, X., Vaikuntanathan, V., Voulgaris, P., Wee, H.: Functional encryption for threshold functions (or, fuzzy IBE) from lattices. In: Fischlin, et al. (eds.) [25], pp. 280\u2013297","DOI":"10.1007\/978-3-642-30057-8_17"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-25385-0_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"S. Agrawal","year":"2011","unstructured":"Agrawal, S., Freeman, D.M., Vaikuntanathan, V.: Functional Encryption for Inner Product Predicates from Learning with Errors. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 21\u201340. Springer, Heidelberg (2011), the full version is available at \n                      http:\/\/eprint.iacr.org\/2011\/410"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M. Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating Hard Instances of the Short Basis Problem. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 1\u20139. Springer, Heidelberg (1999)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff, J., Peikert, C.: Circular and KDM security for identity-based encryption. In: Fischlin, et al. (eds.) [25], pp. 334\u2013352","DOI":"10.1007\/978-3-642-30057-8_20"},{"key":"15_CR9","series-title":"LIPIcs","first-page":"75","volume-title":"STACS 2009","author":"J. Alwen","year":"2009","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: Albers, S., Marion, J.Y. (eds.) STACS 2009. LIPIcs, vol.\u00a03, pp. 75\u201386. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-642-13013-7_23","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"N. Attrapadung","year":"2010","unstructured":"Attrapadung, N., Libert, B.: Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 384\u2013402. Springer, Heidelberg (2010)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-73458-1_21","volume-title":"Information Security and Privacy","author":"J. Birkett","year":"2007","unstructured":"Birkett, J., Dent, A.W., Neven, G., Schuldt, J.C.N.: Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, pp. 274\u2013292. Springer, Heidelberg (2007)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. Journal of Cryptology 24(4), 659\u2013693 (2011), a preliminary version appeared In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"issue":"5","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/S009753970544713X","volume":"36","author":"D. Boneh","year":"2006","unstructured":"Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. SIAM Journal on Computing\u00a036(5), 1301\u20131328 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-540-89255-7_28","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"D. Boneh","year":"2008","unstructured":"Boneh, D., Hamburg, M.: Generalized Identity Based and Broadcast Encryption Schemes. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 455\u2013470. Springer, Heidelberg (2008)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, Subset, and Range Queries on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 535\u2013554. Springer, Heidelberg (2007)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Boyen, X.: Attribute-based encryption from lattices (2012) (to appear TCC 2013)","DOI":"10.1007\/978-3-642-36594-2_8"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"CRYPTO 2012","author":"Z. Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 868\u2013886. Springer, Heidelberg (2012), see also \n                      http:\/\/eprint.iacr.org\/2012\/078"},{"key":"15_CR18","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (2012), see also \n                      http:\/\/eprint.iacr.org\/2011\/277"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS 2011, pp. 97\u2013106. IEEE Computer Society (2011), see also \n                      http:\/\/eprint.iacr.org\/2011\/344","DOI":"10.1109\/FOCS.2011.12"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert (ed.) [27], pp. 523\u2013552","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Chen, J., Lim, H.W., Ling, S., Wang, H.: The relation and transformation between hierarchical inner product encryption and spatial encryption. Designs, Codes and Cryptography, Online First (2012), see also \n                      http:\/\/eprint.iacr.org\/2011\/455","DOI":"10.1007\/s10623-012-9742-y"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-31448-3_29","volume-title":"Information Security and Privacy","author":"J. Chen","year":"2012","unstructured":"Chen, J., Lim, H.W., Ling, S., Wang, H., Nguyen, K.: Revocable Identity-Based Encryption from Lattices. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol.\u00a07372, pp. 390\u2013403. Springer, Heidelberg (2012), the full version is available at \n                      http:\/\/eprint.iacr.org\/2011\/583"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-03356-8_11","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"R. Cramer","year":"2009","unstructured":"Cramer, R., Damg\u00e5rd, I.: On the Amortized Complexity of Zero-Knowledge Protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 177\u2013191. Springer, Heidelberg (2009)"},{"key":"15_CR24","unstructured":"Dwork, C. (ed.): Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20. ACM (2008)"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography \u2013 PKC 2012","year":"2012","unstructured":"Fischlin, M., Buchmann, J., Manulis, M. (eds.): PKC 2012. LNCS, vol.\u00a07293. Springer, Heidelberg (2012)"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork (ed.) [24], pp. 197\u2013206, see also \n                      http:\/\/eprint.iacr.org\/2007\/432","DOI":"10.1145\/1374376.1374407"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","year":"2010","unstructured":"Gilbert, H. (ed.): EUROCRYPT 2010. LNCS, vol.\u00a06110. Springer, Heidelberg (2010)"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17373-8_23","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"S.D. Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J., Vaikuntanathan, V.: A Group Signature Scheme from Lattice Assumptions. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 395\u2013412. Springer, Heidelberg (2010)"},{"key":"15_CR29","unstructured":"Hamburg, M.: Spatial Encryption. Ph.D. thesis, Stanford University (2011), \n                      http:\/\/eprint.iacr.org\/2011\/389"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-78967-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Katz","year":"2008","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 146\u2013162. Springer, Heidelberg (2008), the full version is available at \n                      http:\/\/eprint.iacr.org\/2007\/404"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Lewko, A., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In: Gilbert (ed.) [27], pp. 62\u201391, the full version is available at \n                      http:\/\/eprint.iacr.org\/2010\/110","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert (ed.) [27], pp. 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"15_CR33","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity 16, 365\u2013411 (2007), a preliminary version appeared in FOCS 2002 (2002), See also ECCC TR04-095","journal-title":"Computational Complexity"},{"key":"15_CR34","unstructured":"Micciancio, D., Peikert, C.: Private communication (December 12, 2012)"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Pointcheval, Johansson (eds.) [44], pp. 700\u2013718, \n                      http:\/\/eprint.iacr.org\/2011\/501","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-10366-7_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"T. Okamoto","year":"2009","unstructured":"Okamoto, T., Takashima, K.: Hierarchical Predicate Encryption for Inner-Products. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 214\u2013231. Springer, Heidelberg (2009)"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Takashima, K.: Fully secure functional encryption with general relations from the decisional linear assumption. In: Rabin (ed.) [45], pp. 191\u2013208, the full version is available at \n                      http:\/\/eprint.iacr.org\/2010\/563","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-25513-7_11","volume-title":"Cryptology and Network Security","author":"T. Okamoto","year":"2011","unstructured":"Okamoto, T., Takashima, K.: Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption. In: Lin, D., Tsudik, G., Wang, X. (eds.) CANS 2011. LNCS, vol.\u00a07092, pp. 138\u2013159. Springer, Heidelberg (2011), the full version is available at \n                      http:\/\/eprint.iacr.org\/2010\/648"},{"key":"15_CR39","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Takashima, K.: Adaptively attribute-hiding (hierarchical) inner product encryption. In: Pointcheval, Johansson (eds.) [44], pp. 591\u2013608, the full version is available at \n                      http:\/\/eprint.iacr.org\/2010\/543","DOI":"10.1007\/978-3-642-29011-4_35"},{"issue":"3","key":"15_CR40","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10623-010-9405-9","volume":"58","author":"J.H. Park","year":"2011","unstructured":"Park, J.H.: Inner-product encryption under standard assumptions. Designs, Codes and Cryptography\u00a058(3), 235\u2013257 (2011)","journal-title":"Designs, Codes and Cryptography"},{"key":"15_CR41","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Mitzenmacher, M. (ed.) STOC 2009, pp. 333\u2013342. ACM (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Peikert, C.: An efficient and parallel Gaussian sampler for lattices. In: Rabin (ed.) [45], pp. 80\u201397","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"15_CR43","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Dwork (ed.) [24], pp. 187\u2013196"},{"key":"15_CR44","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","year":"2012","unstructured":"Pointcheval, D., Johansson, T. (eds.): EUROCRYPT 2012. LNCS, vol.\u00a07237. Springer, Heidelberg (2012)"},{"key":"15_CR45","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","year":"2010","unstructured":"Rabin, T. (ed.): CRYPTO 2010. LNCS, vol.\u00a06223. Springer, Heidelberg (2010)"},{"key":"15_CR46","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM 56(6), Article 34 (2009), a preliminary version appeared in STOC 2005 (2005)","DOI":"10.1145\/1568318.1568324"},{"key":"15_CR47","unstructured":"Stehl\u00e9, D.: Private communication (December 12, 2012)"},{"key":"15_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient Identity-Based Encryption Without Random Oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005), the full version is available at \n                      http:\/\/eprint.iacr.org\/2004\/180"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36362-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:30:20Z","timestamp":1630456220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-36362-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363610","9783642363627"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36362-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}