{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:02:14Z","timestamp":1757617334916,"version":"3.44.0"},"reference-count":11,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,9,1]]},"DOI":"10.1587\/transfun.2024eap1136","type":"journal-article","created":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T17:13:03Z","timestamp":1741281183000},"page":"1265-1274","source":"Crossref","is-referenced-by-count":0,"title":["Issuer-Revocable Issuer-Hiding Attribute-Based Credentials Using an Accumulator"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Nasima","family":"BEGUM","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Asia Pacific"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toru","family":"NAKANISHI","sequence":"additional","affiliation":[{"name":"Graduate School of Advanced Science and Engineering, Hiroshima University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] D. Bosk, D. Frey, M. Gestin, and G. Piolle, \u201cHidden issuer anonymous credential,\u201d Proc. Privacy Enhancing Technologies, vol.2022, no.4, pp.571-607, 2022. 10.56553\/popets-2022-0123","DOI":"10.56553\/popets-2022-0123"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, \u201cIssuer-hiding attribute-based credentials,\u201d Proc. CANS 2021, pp.158-178, LNCS 13099, 2021. 10.1007\/978-3-030-92548-2_9","DOI":"10.1007\/978-3-030-92548-2_9"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] N. Begum and T. Nakanishi, \u201cIssuer-revocable issuer-hiding attribute-based credentials using an accumulator,\u201d 2023 Eleventh International Symposium on Computing and Networking (CANDAR), pp.93-99, Nov. 2023. 10.1109\/candar60563.2023.00019","DOI":"10.1109\/CANDAR60563.2023.00019"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S. Goldwasser, S. Micali, and R.L. Rivest, \u201cA digital signature scheme secure against adaptive chosenmessage attacks,\u201d SIAM J. Comput., vol.17, no.2, pp.281-308, April 1988. 10.1137\/0217017","DOI":"10.1137\/0217017"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Y. Aikou, S. Sadiah, and T. Nakanishi, \u201cAn efficient blacklistable anonymous credentials without TTPs using pairing-based accumulator,\u201d Proc. AINA 2017, pp.780-786, 2017. 10.1109\/aina.2017.31","DOI":"10.1109\/AINA.2017.31"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] N. Begum and T. Nakanishi, \u201cAn accumulator-based revocation in delegatable anonymous credentials,\u201d Proc. CANDARW 2020, WICS 2020, pp.314-320, 2020. 10.1109\/candarw51189.2020.00068","DOI":"10.1109\/CANDARW51189.2020.00068"},{"key":"7","unstructured":"[7] K. Elkhiyaoui, A.D. Caro, and E. Androulaki, \u201cMulti-issuer anonymous credentials without a root authority,\u201d Cryptology ePrint Archive, report 2021\/1669, 2021."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] J. Groth and M. Kohlweiss, \u201cOne-out-of-many proofs: Or how to leak a secret and spend a coin,\u201d Proc. EUROCRYPT 2015, Part II, LNCS 9057, pp.253-280, 2015. 10.1007\/978-3-662-46803-6_9","DOI":"10.1007\/978-3-662-46803-6_9"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J. Groth, \u201cEfficient fully structure-preserving signatures for large messages,\u201d Proc. ASIACRYPT 2015, Part I, LNCS 9452, pp.239-259, 2015. 10.1007\/978-3-662-48797-6_11","DOI":"10.1007\/978-3-662-48797-6_11"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] J. Camenisch, M. Kohlweiss, and C. Soriente, \u201cAn accumulator based on bilinear maps and efficient revocation for anonymous credentials,\u201d Proc. PKC 2009, LNCS 5443, pp.481-500, 2009. 10.1007\/978-3-642-00468-1_27","DOI":"10.1007\/978-3-642-00468-1_27"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] K. Emura and T. Hayashi, \u201cA revocable group signature scheme with scalability from simple assumptions,\u201d IEICE Trans. Fundamentals, vol.E103-A, no.1, pp.125-140, Jan. 2020. 10.1587\/transfun.2019cip0004","DOI":"10.1587\/transfun.2019CIP0004"}],"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\/E108.A\/9\/E108.A_2024EAP1136\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T03:34:19Z","timestamp":1757129659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/9\/E108.A_2024EAP1136\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"references-count":11,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024eap1136","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"article-number":"2024EAP1136"}}