{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T19:29:05Z","timestamp":1710271745416},"reference-count":42,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2020,7,1]]},"DOI":"10.1587\/transinf.2019icp0001","type":"journal-article","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T22:14:44Z","timestamp":1593555284000},"page":"1556-1597","source":"Crossref","is-referenced-by-count":2,"title":["Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Pratish","family":"DATTA","sequence":"first","affiliation":[{"name":"NTT Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuaki","family":"OKAMOTO","sequence":"additional","affiliation":[{"name":"NTT Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuyuki","family":"TAKASHIMA","sequence":"additional","affiliation":[{"name":"Mitsubishi Electric Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] P. Datta, T. Okamoto, and K. Takashima, \u201cAdaptively simulation-secure attribute-hiding predicate encryption,\u201d ASIACRYPT 2018, pp.640-672, Springer, 2018. 10.1007\/978-3-030-03329-3_22","DOI":"10.1007\/978-3-030-03329-3_22"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] D. Boneh, A. Sahai, and B. Waters, \u201cFunctional encryption: Definitions and challenges,\u201d TCC 2011, pp.253-273, Springer, 2011. 10.1007\/978-3-642-19571-6_16","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"3","unstructured":"[3] A. O'Neill, \u201cDefinitional issues in functional encryption,\u201d Cryptology ePrint Archive, Report 2010\/556, 2010."},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] M. Bellare and A. O'Neill, \u201cSemantically-secure functional encryption: Possibility results, impossibility results and the quest for a general definition,\u201d CANS 2013, pp.218-234, Springer, 2013. 10.1007\/978-3-319-02937-5_12","DOI":"10.1007\/978-3-319-02937-5_12"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S. Agrawal, S. Gorbunov, V. Vaikuntanathan, and H. Wee, \u201cFunctional encryption: New perspectives and lower bounds,\u201d CRYPTO 2013, pp.500-518, Springer, 2013. 10.1007\/978-3-642-40084-1_28","DOI":"10.1007\/978-3-642-40084-1_28"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] A. De Caro, V. Iovino, A. Jain, A. O'Neill, O. Paneth, and G.Persiano, \u201cOn the achievability of simulation-based security for functional encryption,\u201d CRYPTO 2013, pp.519-535, Springer, 2013. 10.1007\/978-3-642-40084-1_29","DOI":"10.1007\/978-3-642-40084-1_29"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] V. Goyal, O. Pandey, A. Sahai, and B. Waters, \u201cAttribute-based encryption for fine-grained access control of encrypted data,\u201d CCS 2006, pp.89-98, ACM, 2006. 10.1145\/1180405.1180418","DOI":"10.1145\/1180405.1180418"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] A. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B. Waters, \u201cFully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption,\u201d EUROCRYPT 2010, pp.62-91, Springer, 2010. 10.1007\/978-3-642-13190-5_4","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] T. Okamoto and K. Takashima, \u201cFully secure functional encryption with general relations from the decisional linear assumption,\u201d CRYPTO 2010, pp.191-208, Springer, 2010. 10.1007\/978-3-642-14623-7_11","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] T. Okamoto and K. Takashima, \u201cFully secure unbounded inner-product and attribute-based encryption,\u201d ASIACRYPT 2012, pp.349-366, Springer, 2012. 10.1007\/978-3-642-34961-4_22","DOI":"10.1007\/978-3-642-34961-4_22"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Y. Ishai and H. Wee, \u201cPartial garbling schemes and their applications,\u201d ICALP 2014, pp.650-662, Springer, 2014. 10.1007\/978-3-662-43948-7_54","DOI":"10.1007\/978-3-662-43948-7_54"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Lewko and B. Waters, \u201cNew proof methods for attribute-based encryption: Achieving full security through selective techniques,\u201d CRYPTO 2012, pp.180-198, Springer, 2012. 10.1007\/978-3-642-32009-5_12","DOI":"10.1007\/978-3-642-32009-5_12"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] H. Wee, \u201cDual system encryption via predicate encodings,\u201d TCC 2014, pp.616-637, Springer, 2014. 10.1007\/978-3-642-54242-8_26","DOI":"10.1007\/978-3-642-54242-8_26"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] N. Attrapadung, \u201cDual system encryption via doubly selective security: Framework, fully secure functional encryption for regular languages, and more,\u201d EUROCRYPT 2014, pp.557-577, Springer, 2014. 10.1007\/978-3-642-55220-5_31","DOI":"10.1007\/978-3-642-55220-5_31"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] J. Chen, R. Gay, and H. Wee, \u201cImproved dual system abe in prime-order groups via predicate encodings,\u201d EUROCRYPT 2015, pp.595-624, Springer, 2015. 10.1007\/978-3-662-46803-6_20","DOI":"10.1007\/978-3-662-46803-6_20"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] S. Gorbunov, V. Vaikuntanathan, and H. Wee, \u201cAttribute-based encryption for circuits,\u201d Journal of the ACM (JACM), vol.62, no.6, 2015. 10.1145\/2824233","DOI":"10.1145\/2824233"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] D. Boneh, C. Gentry, S. Gorbunov, S. Halevi, V. Nikolaenko, G. Segev, V. Vaikuntanathan, and D. Vinayagamurthy, \u201cFully key-homomorphic encryption, arithmetic circuit abe and compact garbled circuits,\u201d EUROCRYPT 2014, pp.533-556, Springer, 2014. 10.1007\/978-3-642-55220-5_30","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] S. Gorbunov, V. Vaikuntanathan, and H. Wee, \u201cPredicate encryption for circuits from lwe,\u201d CRYPTO 2015, pp.503-523, Springer, 2015. 10.1007\/978-3-662-48000-7_25","DOI":"10.1007\/978-3-662-48000-7_25"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] D. Boneh and B. Waters, \u201cConjunctive, subset, and range queries on encrypted data,\u201d TCC 2007, pp.535-554, Springer, 2007. 10.1007\/978-3-540-70936-7_29","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] J. Katz, A. Sahai, and B. Waters, \u201cPredicate encryption supporting disjunctions, polynomial equations, and inner products,\u201dEUROCRYPT 2008, pp.146-162, Springer, 2008. 10.1007\/978-3-540-78967-3_9","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] T. Okamoto and K. Takashima, \u201cAdaptively attribute-hiding (hierarchical) inner product encryption,\u201d EUROCRYPT 2012, pp.591-608, Springer, 2012. 10.1007\/978-3-642-29011-4_35","DOI":"10.1007\/978-3-642-29011-4_35"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] T. Okamoto and K. Takashima, \u201cEfficient (hierarchical) inner-product encryption tightly reduced from the decisional linear assumption,\u201d IEICE Trans. Fundamentals, vol.E96-A, no.1, pp.42-52, 2013. 10.1587\/transfun.e96.a.42","DOI":"10.1587\/transfun.E96.A.42"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] P. Ananth and A. Jain, \u201cIndistinguishability obfuscation from compact functional encryption,\u201d CRYPTO 2015, pp.308-326, Springer, 2015. 10.1007\/978-3-662-47989-6_15","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] N. Bitansky and V. Vaikuntanathan, \u201cIndistinguishability obfuscation from functional encryption,\u201d FOCS 2015, pp.171-190, IEEE, 2015. 10.1109\/focs.2015.20","DOI":"10.1109\/FOCS.2015.20"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] P. Ananth, A. Jain, and A. Sahai, \u201cIndistinguishability obfuscation from functional encryption for simple functions,\u201d Cryptology ePrint Archive, Report 2015\/730, 2015.","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] H. Wee, \u201cAttribute-hiding predicate encryption in bilinear groups, revisited,\u201d TCC 2017, pp.206-233, Springer, 2017. 10.1007\/978-3-319-70500-2_8","DOI":"10.1007\/978-3-319-70500-2_8"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] S. Agrawal, \u201cStronger security for reusable garbled circuits, general definitions and attacks,\u201d CRYPTO 2017, pp.3-35, Springer, 2017. 10.1007\/978-3-319-63688-7_1","DOI":"10.1007\/978-3-319-63688-7_1"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] J. Chen and H. Wee, \u201cSemi-adaptive attribute-based encryption and improved delegation for boolean formula,\u201d SCN 2014, pp.277-297, Springer, 2014. 10.1007\/978-3-319-10879-7_16","DOI":"10.1007\/978-3-319-10879-7_16"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] R. Goyal, V. Koppula, and B. Waters, \u201cSemi-adaptive security and bundling functionalities made generic and easy,\u201d TCC 2016, pp.361-388, Springer, 2016. 10.1007\/978-3-662-53644-5_14","DOI":"10.1007\/978-3-662-53644-5_14"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] P. Ananth, Z. Brakerski, G. Segev, and V. Vaikuntanathan, \u201cFrom selective to adaptive security in functional encryption,\u201d CRYPTO 2015, pp.657-677, Springer, 2015. 10.1007\/978-3-662-48000-7_32","DOI":"10.1007\/978-3-662-48000-7_32"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] M. Abe, M. Chase, B. David, M. Kohlweiss, R. Nishimaki, and M. Ohkubo, \u201cConstant-size structure-preserving signatures: Generic constructions and simple assumptions,\u201d ASIACRYPT 2012, pp.4-24, 2012.","DOI":"10.1007\/978-3-642-34961-4_3"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] J. Tomida, M. Abe, and T. Okamoto, \u201cEfficient functional encryption for inner-product values with full-hiding security,\u201d ISC 2016, pp.408-425, Springer, 2016. 10.1007\/978-3-319-45871-7_24","DOI":"10.1007\/978-3-319-45871-7_24"},{"key":"33","doi-asserted-by":"publisher","unstructured":"[33] D.M. Freeman, \u201cConverting pairing-based cryptosystems from composite-order groups to prime-order groups,\u201d EUROCRYPT 2010, pp.44-61, Springer, 2010. 10.1007\/978-3-642-13190-5_3","DOI":"10.1007\/978-3-642-13190-5_3"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] A. Guillevic, \u201cComparing the pairing efficiency over composite-order and prime-order elliptic curves,\u201d ACNS 2013, pp.357-372, Springer, 2013. 10.1007\/978-3-642-38980-1_22","DOI":"10.1007\/978-3-642-38980-1_22"},{"key":"35","doi-asserted-by":"publisher","unstructured":"[35] R. Barbulescu, P. Gaudry, A. Joux, and E. Thom\u00e9, \u201cA heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic,\u201d EUROCRYPT 2014, pp.1-16, Springer, 2014. 10.1007\/978-3-642-55220-5_1","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"36","doi-asserted-by":"publisher","unstructured":"[36] F. G\u00f6lo\u011flu, R. Granger, G. McGuire, and J. Zumbr\u00e4gel, \u201cOn the function field sieve and the impact of higher splitting probabilities,\u201d CRYPTO 2013, pp.109-128, Springer, 2013. 10.1007\/978-3-642-40084-1_7","DOI":"10.1007\/978-3-642-40084-1_7"},{"key":"37","doi-asserted-by":"publisher","unstructured":"[37] A. Joux, \u201cFaster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields,\u201d EUROCRYPT 2013, pp.177-193, Springer, 2013. 10.1007\/978-3-642-38348-9_11","DOI":"10.1007\/978-3-642-38348-9_11"},{"key":"38","doi-asserted-by":"publisher","unstructured":"[38] A. Joux, \u201cA new index calculus algorithm with complexity l (1\/4+ o (1)) in small characteristic,\u201d SAC 2013, pp.355-379, Springer, 2013. 10.1007\/978-3-662-43414-7_18","DOI":"10.1007\/978-3-662-43414-7_18"},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] B. Waters, \u201cDual system encryption: Realizing fully secure ibe and hibe under simple assumptions,\u201d CRYPTO 2009, pp.619-636, Springer, 2009. 10.1007\/978-3-642-03356-8_36","DOI":"10.1007\/978-3-642-03356-8_36"},{"key":"40","doi-asserted-by":"crossref","unstructured":"[40] T. Okamoto and K. Takashima, \u201cHierarchical predicate encryption for inner-products,\u201d ASIACRYPT 2009, pp.214-231, Springer, 2009. 10.1007\/978-3-642-10366-7_13","DOI":"10.1007\/978-3-642-10366-7_13"},{"key":"41","unstructured":"[41] Y. Ishai and E. Kushilevitz, \u201cPrivate simultaneous messages protocols with applications,\u201d Proc. Fifth Israeli Symposium on Theory of Computing and Systems, 1997, pp.174-184, IEEE, 1997. 10.1109\/istcs.1997.595170"},{"key":"42","doi-asserted-by":"crossref","unstructured":"[42] Y. Ishai and E. Kushilevitz, \u201cPerfect constant-round secure computation via perfect randomizing polynomials,\u201d ICALP 2002, pp.244-256, Springer, 2002. 10.1007\/3-540-45465-9_22","DOI":"10.1007\/3-540-45465-9_22"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/7\/E103.D_2019ICP0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,4]],"date-time":"2020-07-04T03:24:18Z","timestamp":1593833058000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/7\/E103.D_2019ICP0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":42,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019icp0001","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,1]]}}}