{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T10:30:23Z","timestamp":1790677823399,"version":"4.1.0"},"reference-count":50,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1587\/transfun.2019cip0008","type":"journal-article","created":{"date-parts":[[2019,12,31]],"date-time":"2019-12-31T22:06:01Z","timestamp":1577829961000},"page":"41-73","source":"Crossref","is-referenced-by-count":20,"title":["Decentralized Attribute-Based Encryption and Signatures"],"prefix":"10.1587","volume":"E103.A","author":[{"given":"Tatsuaki","family":"OKAMOTO","sequence":"first","affiliation":[{"name":"NTT Research Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katsuyuki","family":"TAKASHIMA","sequence":"additional","affiliation":[{"name":"Information Technology R&D Center, Mitsubishi Electric Corporation"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] T. Okamoto and K. Takashima, \u201cDecentralized attribute-based signatures,\u201d PKC 2013, K. Kurosawa and G. Hanaoka, eds., Lecture Notes in Computer Science, vol.7778, pp.125-142, Springer, 2013. 10.1007\/978-3-642-36362-7_9","DOI":"10.1007\/978-3-642-36362-7_9"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] J. Bethencourt, A. Sahai, and B. Waters, \u201cCiphertext-policy attribute-based encryption,\u201d IEEE Symposium on Security and Privacy, pp.321-334, IEEE Computer Society, 2007. 10.1109\/sp.2007.11","DOI":"10.1109\/SP.2007.11"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] V. Goyal, O. Pandey, A. Sahai, and B. Waters, \u201cAttribute-based encryption for fine-grained access control of encrypted data,\u201d in Juels et al. [50], pp.89-98, 2006. 10.1145\/1180405.1180418","DOI":"10.1145\/1180405.1180418"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] R. Ostrovsky, A. Sahai, and B. Waters, \u201cAttribute-based encryption with non-monotonic access structures,\u201d ACM CCS 2007, P. Ning, S.D.C. di Vimercati, and P.F. Syverson, eds., pp.195-203, ACM, 2007. 10.1145\/1315245.1315270","DOI":"10.1145\/1315245.1315270"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M. Pirretti, P. Traynor, P. McDaniel, and B. Waters, \u201cSecure attribute-based systems,\u201d in Juels et al. [50], pp.99-112, 2006. 10.1145\/1180405.1180419","DOI":"10.1145\/1180405.1180419"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] A. Sahai and B. Waters, \u201cFuzzy identity-based encryption,\u201d EUROCRYPT 2005, R. Cramer, ed., LNCS, vol.3494, pp.457-473, Springer, 2005. 10.1007\/11426639_27","DOI":"10.1007\/11426639_27"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] D. Boneh and X. Boyen, \u201cEfficient selective-ID secure identity-based encryption without random oracles,\u201d EUROCRYPT 2004, C. Cachin and J. Camenisch, eds., LNCS, vol.3027, pp.223-238, Springer, 2004. 10.1007\/978-3-540-24676-3_14","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] D. Boneh and X. Boyen, \u201cSecure identity based encryption without random oracles,\u201d in Franklin [49], pp.443-459, 2004. 10.1007\/978-3-540-28628-8_27","DOI":"10.1007\/978-3-540-28628-8_27"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] D. Boneh and M.K. Franklin, \u201cIdentity-based encryption from the Weil pairing,\u201d CRYPTO 2001, J. Kilian, ed., LNCS, vol.2139, pp.213-229, Springer, 2001. 10.1007\/3-540-44647-8_13","DOI":"10.1007\/3-540-44647-8_13"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] C. Cocks, \u201cAn identity based encryption scheme based on quadratic residues,\u201d IMA Int. Conf. 2001, B. Honary, ed., LNCS, vol.2260, pp.360-363, Springer, 2001. 10.1007\/3-540-45325-3_32","DOI":"10.1007\/3-540-45325-3_32"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] C. Gentry, \u201cPractical identity-based encryption without random oracles,\u201d EUROCRYPT 2006, S. Vaudenay, ed., LNCS, vol.4004, pp.445-464, Springer, 2006. 10.1007\/11761679_27","DOI":"10.1007\/11761679_27"},{"key":"12","unstructured":"[12] S. Guo and Y. Zeng, \u201cAttribute-based signature scheme,\u201d ISA, pp.509-511, IEEE, 2008. 10.1109\/isa.2008.111"},{"key":"13","unstructured":"[13] D. Khader, \u201cAttribute based group signatures,\u201d IACR Cryptology ePrint Archive, vol.2007, p.159, 2007."},{"key":"14","unstructured":"[14] D. Khader, \u201cAttribute based group signature with revocation,\u201d IACR Cryptology ePrint Archive, vol.2007, p.241, 2007."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] J. Li, M.H. Au, W. Susilo, D. Xie, and K. Ren, \u201cAttribute-based signature and its applications,\u201d ASIACCS, D. Feng, D.A. Basin, and P. Liu, eds., pp.60-69, ACM, 2010. 10.1145\/1755688.1755697","DOI":"10.1145\/1755688.1755697"},{"key":"16","unstructured":"[16] J. Li and K. Kim, \u201cAttribute-based ring signatures,\u201d IACR Cryptology ePrint Archive, vol.2008, p.394, 2008."},{"key":"17","unstructured":"[17] H.K. Maji, M. Prabhakaran, and M. Rosulek, \u201cAttribute-based signatures: Achieving attribute-privacy and collusion-resistance,\u201d IACR Cryptology ePrint Archive, vol.2008, p.328, 2008."},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] H.K. Maji, M. Prabhakaran, and M. Rosulek, \u201cAttribute-based signatures,\u201d CT-RSA, A. Kiayias, ed., Lecture Notes in Computer Science, vol.6558, pp.376-392, Springer, 2011. 10.1007\/978-3-642-19074-2_24","DOI":"10.1007\/978-3-642-19074-2_24"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] T. Okamoto and K. Takashima, \u201cEfficient attribute-based signatures for non-monotone predicates in the standard model,\u201d Public Key Cryptography, D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, eds., LNCS, vol.6571, pp.35-52, Springer, 2011. This is an extended abstract of a preliminary version of [47]. 10.1007\/978-3-642-19379-8_3","DOI":"10.1007\/978-3-642-19379-8_3"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] S.F. Shahandashti and R. Safavi-Naini, \u201cThreshold attribute-based signatures and their application to anonymous credential systems,\u201d AFRICACRYPT, B. Preneel, eds., Lecture Notes in Computer Science, vol.5580, pp.198-216, Springer, 2009. 10.1007\/978-3-642-02384-2_13","DOI":"10.1007\/978-3-642-02384-2_13"},{"key":"21","unstructured":"[21] P. Yang, Z. Cao, and X. Dong, \u201cFuzzy identity based signature,\u201d IACR Cryptology ePrint Archive, vol.2008, p.2, 2008."},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Chase, \u201cMulti-authority attribute based encryption,\u201d TCC, S.P. Vadhan, ed., LNCS, vol.4392, pp.515-534, Springer, 2007. 10.1007\/978-3-540-70936-7_28","DOI":"10.1007\/978-3-540-70936-7_28"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] M. Chase and S.S.M. Chow, \u201cImproving privacy and security in multi-authority attribute-based encryption,\u201d ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A.D. Keromytis, eds., pp.121-130, ACM, 2009. 10.1145\/1653662.1653678","DOI":"10.1145\/1653662.1653678"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] H. Lin, Z. Cao, X. Liang, and J. Shao, \u201cSecure threshold multi authority attribute based encryption without a central authority,\u201d Inf. Sci., vol.180, no.13, pp.2618-2632, 2010. 10.1016\/j.ins.2010.03.004","DOI":"10.1016\/j.ins.2010.03.004"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] S. Mueller, S. Katzenbeisser, and C. Eckert, \u201cOn multi-authority ciphertext-policy attribute-based encryption,\u201d Fraunhofer SIT, vol.46, 07 2009.","DOI":"10.4134\/BKMS.2009.46.4.803"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] A.B. Lewko and B. Waters, \u201cDecentralizing attribute-based encryption,\u201d EUROCRYPT 2011, K.G. Paterson, ed., LNCS, vol.6632, pp.568-588, Springer, 2011. 10.1007\/978-3-642-20465-4_31","DOI":"10.1007\/978-3-642-20465-4_31"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] T. Okamoto and K. Takashima, \u201cFully secure functional encryption with general relations from the decisional linear assumption,\u201d CRYPTO 2010, T. Rabin, ed., LNCS, vol.6223, pp.191-208, Springer, 2010. The full version is available as an online first article in Journal of Cryptology. 10.1007\/978-3-642-14623-7_11","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"28","unstructured":"[28] ISO\/IEC 15946-5, \u201cInformation technology-Security techniques-Cryptographic techniques based on elliptic curves-Part 5: Elliptic curve generation,\u201d ISO\/IEC, 2009."},{"key":"29","unstructured":"[29] FIPS PUB 180-1, 180-2, \u201cSecure hash standard,\u201d NIST, 1995, 2002."},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] N. Estibals, \u201cCompact hardware for computing the tate pairing over 128-bit-security supersingular curves,\u201d Pairing, M. Joye, A. Miyaji, and A. Otsuka, eds., Lecture Notes in Computer Science, vol.6487, pp.397-416, Springer, 2010. 10.1007\/978-3-642-17455-1_25","DOI":"10.1007\/978-3-642-17455-1_25"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] R.L. Rivest, A. Shamir, and Y. Tauman, \u201cHow to leak a secret,\u201d ASIACRYPT, C. Boyd, ed., Lecture Notes in Computer Science, vol.2248, pp.552-565, Springer, 2001. 10.1007\/3-540-45682-1_32","DOI":"10.1007\/3-540-45682-1_32"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] H. Shacham and B. Waters, \u201cEfficient ring signatures without random oracles,\u201d Public Key Cryptography, T. Okamoto and X. Wang, eds., Lecture Notes in Computer Science, vol.4450, pp.166-180, Springer, 2007. 10.1007\/978-3-540-71677-8_12","DOI":"10.1007\/978-3-540-71677-8_12"},{"key":"33","doi-asserted-by":"publisher","unstructured":"[33] T. Okamoto and K. Takashima, \u201cDual pairing vector spaces and their applications,\u201d IEICE Trans. Fundamentals, vol.E98-A, no.1, pp.3-15, Jan. 2015. 10.1587\/transfun.e98.a.3","DOI":"10.1587\/transfun.E98.A.3"},{"key":"34","unstructured":"[34] A.B. Lewko, Functional Encryption: New Proof Techniques and Advancing Capabilities, Ph.D. thesis, The University of Texas at Austin, 2012."},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] Y. Rouselakis and B. Waters, \u201cEfficient statically-secure large-universe multi-authority attribute-based encryption,\u201d Financial Cryptography and Data Security-19th International Conference, FC 2015, Revised Selected Papers, pp.315-332, San Juan, Puerto Rico, Jan. 2015. 10.1007\/978-3-662-47854-7_19","DOI":"10.1007\/978-3-662-47854-7_19"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] X. Boyen, \u201cMesh signatures,\u201d EUROCRYPT, M. Naor, ed., Lecture Notes in Computer Science, vol.4515, pp.210-227, Springer, 2007. 10.1007\/978-3-540-72540-4_12","DOI":"10.1007\/978-3-540-72540-4_12"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya, and H. Shacham, \u201cRandomizable proofs and delegatable anonymous credentials,\u201d in Halevi [48], pp.108-125, 2009. 10.1007\/978-3-642-03356-8_7","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"38","doi-asserted-by":"crossref","unstructured":"[38] M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lysyanskaya, \u201cP-signatures and noninteractive anonymous credentials,\u201d TCC, R. Canetti, ed., Lecture Notes in Computer Science, vol.4948, pp.356-374, Springer, 2008. 10.1007\/978-3-540-78524-8_20","DOI":"10.1007\/978-3-540-78524-8_20"},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] J. Camenisch and T. Gro\u00df, \u201cEfficient attributes for anonymous credentials,\u201d ACM Conference on Computer and Communications Security, P. Ning, P.F. Syverson, and S. Jha, eds., pp.345-356, ACM, 2008. 10.1145\/1455770.1455814","DOI":"10.1145\/1455770.1455814"},{"key":"40","doi-asserted-by":"publisher","unstructured":"[40] J. Camenisch and A. Lysyanskaya, \u201cAn efficient system for non-transferable anonymous credentials with optional anonymity revocation,\u201d EUROCRYPT, B. Pfitzmann, ed., Lecture Notes in Computer Science, vol.2045, pp.93-118, Springer, 2001. 10.1007\/3-540-44987-6_7","DOI":"10.1007\/3-540-44987-6_7"},{"key":"41","doi-asserted-by":"crossref","unstructured":"[41] J. Camenisch and A. Lysyanskaya, \u201cSignature schemes and anonymous credentials from bilinear maps,\u201d in Franklin [49], pp.56-72, 2004. 10.1007\/978-3-540-28628-8_4","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"42","doi-asserted-by":"publisher","unstructured":"[42] D. Chaum, \u201cSecurity without identification: Transaction systems to make big brother obsolete,\u201d Commun. ACM, vol.28, no.10, pp.1030-1044, 1985. 10.1145\/4372.4373","DOI":"10.1145\/4372.4373"},{"key":"43","doi-asserted-by":"crossref","unstructured":"[43] T. Okamoto and K. Takashima, \u201cHierarchical predicate encryption for inner-products,\u201d ASIACRYPT 2009, M. Matsui, ed., LNCS, vol.5912, pp.214-231, Springer, 2009. 10.1007\/978-3-642-10366-7_13","DOI":"10.1007\/978-3-642-10366-7_13"},{"key":"44","unstructured":"[44] A. Beimel, Secure Schemes for Secret Sharing and Key Distribution, Ph.D. thesis, Israel Institute of Technology, Technion, Haifa, 1996."},{"key":"45","doi-asserted-by":"publisher","unstructured":"[45] D. Boneh, X. Boyen, and H. Shacham, \u201cShort group signatures,\u201d in Franklin [49], pp.41-55, 2004. 10.1007\/978-3-540-28628-8_3","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"46","doi-asserted-by":"crossref","unstructured":"[46] B. Waters, \u201cDual system encryption: Realizing fully secure IBE and HIBE under simple assumptions,\u201d in Halevi [48], pp.619-636, 2009. 10.1007\/978-3-642-03356-8_36","DOI":"10.1007\/978-3-642-03356-8_36"},{"key":"47","doi-asserted-by":"publisher","unstructured":"[47] T. Okamoto and K. Takashima, \u201cEfficient attribute-based signatures for non-monotone predicates in the standard model,\u201d IEEE Trans. Cloud Comput., vol.2, no.4, pp.409-421, 2014. Full version is available at http:\/\/eprint.iacr.org\/2011\/700. 10.1109\/TCC.2014.2353053","DOI":"10.1109\/TCC.2014.2353053"},{"key":"48","doi-asserted-by":"crossref","unstructured":"[48] S. Halevi, ed., Advances in Cryptology-CRYPTO 2009, 29th Annual International Cryptology Conference, Proceedings, LNCS, vol.5677, Springer, Santa Barbara, CA, USA, Aug. 2009. 10.1007\/978-3-642-03356-8","DOI":"10.1007\/978-3-642-03356-8"},{"key":"49","doi-asserted-by":"crossref","unstructured":"[49] M.K. Franklin, ed., Advances in Cryptology-CRYPTO 2004, 24th Annual International CryptologyConference, Proceedings, LNCS, vol.3152, Springer, Santa Barbara, California, USA, Aug. 2004. 10.1007\/b99099","DOI":"10.1007\/b99099"},{"key":"50","unstructured":"[50] A. Juels, R.N. Wright, and S.D.C. di Vimercati, eds., Proc. 13th ACM Conference on Computer and Communications Security, CCS 2006, ACM, Alexandria, VA, USA, Oct.-Nov. 2006. 10.1145\/1180405"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/1\/E103.A_2019CIP0008\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T05:25:18Z","timestamp":1578288318000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/1\/E103.A_2019CIP0008\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2019cip0008","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}