{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:27:30Z","timestamp":1768314450775,"version":"3.49.0"},"reference-count":43,"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":[[2021,9,1]]},"DOI":"10.1587\/transfun.2020dmp0013","type":"journal-article","created":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T22:07:30Z","timestamp":1615846050000},"page":"1175-1187","source":"Crossref","is-referenced-by-count":3,"title":["Redactable Signature with Compactness from Set-Commitment"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Masayuki","family":"TEZUKA","sequence":"first","affiliation":[{"name":"Department of Mathematical and Computing Sciences, Tokyo Institute of Technology"}]},{"given":"Keisuke","family":"TANAKA","sequence":"additional","affiliation":[{"name":"Department of Mathematical and Computing Sciences, Tokyo Institute of Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] R. Steinfeld, L. Bull, and Y. Zheng, \u201cContent extraction signatures,\u201d ICISC 2001, LNCS, vol.2288, pp.285-304, Springer, 2001. 10.1007\/3-540-45861-1_22","DOI":"10.1007\/3-540-45861-1_22"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] R. Johnson, D. Molnar, D.X. Song, and D.A. Wagner, \u201cHomomorphic signature schemes,\u201d CT-RSA 2002, LNCS, vol.2271, pp.244-262, Springer, 2002. 10.1007\/3-540-45760-7_17","DOI":"10.1007\/3-540-45760-7_17"},{"key":"3","unstructured":"[3] K. Miyazaki, S.S.M. Iwamura, T. Matsumoto, R. Sasaki, and H. Yoshiura, \u201cDigital document sanitizing problem,\u201d IEICE Technical Report, vol.103, no.195, pp.61-67, 2003."},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] G. Ateniese, D.H. Chou, B. de Medeiros, and G. Tsudik, \u201cSanitizable signatures,\u201d ESORICS 2005, LNCS, vol.3679, pp.159-177, Springer, 2005. 10.1007\/11555827_10","DOI":"10.1007\/11555827_10"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C. Brzuska, H. Busch, \u00d6. Dagdelen, M. Fischlin, M. Franz, S. Katzenbeisser, M. Manulis, C. Onete, A. Peter, B. Poettering, and D. Schr\u00f6der, \u201cRedactable signatures for tree-structured data: Definitions and constructions,\u201d ACNS 2010, LNCS, vol.6123, pp.87-104, 2010. 10.1007\/978-3-642-13708-2_6","DOI":"10.1007\/978-3-642-13708-2_6"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] E. Chang, C.L. Lim, and J. Xu, \u201cShort redactable signatures using random trees,\u201d CT-RSA 2009, LNCS, vol.5473, pp.133-147, Springer, 2009. 10.1007\/978-3-642-00862-7_9","DOI":"10.1007\/978-3-642-00862-7_9"},{"key":"7","unstructured":"[7] H.C. P\u00f6hls, K. Samelin, H. de Meer, and J. Posegga, \u201cFlexible redactable signature schemes for trees-extended security model and construction,\u201d SECRYPT 2012, pp.113-125, SciTePress, 2012. 10.5220\/0004038701130125"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] K. Samelin, H.C. P\u00f6hls, A. Bilzhause, J. Posegga, and H. de Meer, \u201cOn structural signatures for tree data structures,\u201d ACNS 2012, LNCS, vol.7341, pp.171-187, Springer, 2012. 10.1007\/978-3-642-31284-7_11","DOI":"10.1007\/978-3-642-31284-7_11"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] A. Kundu and E. Bertino, \u201cPrivacy-preserving authentication of trees and graphs,\u201d Int. J. Inf. Secur., vol.12, no.6, pp.467-494, 2013. 10.1007\/s10207-013-0198-5","DOI":"10.1007\/s10207-013-0198-5"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] R. Nojima, J. Tamura, Y. Kadobayashi, and H. Kikuchi, \u201cA storage efficient redactable signature in the standard model,\u201d ISC 2009, LNCS, vol.5735, pp.326-337, Springer, 2009. 10.1007\/978-3-642-04474-8_26","DOI":"10.1007\/978-3-642-04474-8_26"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] D. Derler, H.C. P\u00f6hls, K. Samelin, and D. Slamanig, \u201cA general framework for redactable signatures and new constructions,\u201d ICISC 2015, LNCS, vol.9558, pp.3-19, Springer, 2015. 10.1007\/978-3-319-30840-1_1","DOI":"10.1007\/978-3-319-30840-1_1"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] H.C. P\u00f6hls and K. Samelin, \u201cOn updatable redactable signatures,\u201d ACNS 2014, LNCS, vol.8479, pp.457-475, Springer, 2014. 10.1007\/978-3-319-07536-5_27","DOI":"10.1007\/978-3-319-07536-5_27"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] K. Samelin, H.C. P\u00f6hls, A. Bilzhause, J. Posegga, and H. de Meer, \u201cRedactable signatures for independent removal of structure and content,\u201d ISPEC 2012, LNCS, vol.7232, pp.17-33, Springer, 2012. 10.1007\/978-3-642-29101-2_2","DOI":"10.1007\/978-3-642-29101-2_2"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J. Camenisch, M. Dubovitskaya, K. Haralambiev, and M. Kohlweiss, \u201cComposable and modular anonymous credentials: Definitions and practical constructions,\u201d ASIACRYPT 2015, Part II, LNCS, vol.9453, pp.262-288, Springer, 2015. 10.1007\/978-3-662-48800-3_11","DOI":"10.1007\/978-3-662-48800-3_11"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] 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":"16","doi-asserted-by":"crossref","unstructured":"[16] O. Sanders, \u201cEfficient redactable signature and application to anonymous credentials,\u201d PKC 2020, Part II, LNCS, vol.12111, pp.628-656, Springer, 2020. 10.1007\/978-3-030-45388-6_22","DOI":"10.1007\/978-3-030-45388-6_22"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] A. Bilzhause, H.C. P\u00f6hls, and K. Samelin, \u201cPosition paper: The past, present, and future of sanitizable and redactable signatures,\u201d ARES 2017, pp.87:1-87:9, ACM, 2017. 10.1145\/3098954.3104058","DOI":"10.1145\/3098954.3104058"},{"key":"18","unstructured":"[18] D. Demirel, D. Derler, C. Hanser, H. P\u00f6hls, D. Slamanig, and G. Traverso, PRISMACLOUD D4.4: Overview of Functional and Malleable Signature Schemes, 2015."},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] J.H. Ahn, D. Boneh, J. Camenisch, S. Hohenberger, A. Shelat, and B. Waters, \u201cComputing on authenticated data,\u201d TCC 2012, LNCS, vol.7194, pp.1-20, Springer, 2012. 10.1007\/978-3-642-28914-9_1","DOI":"10.1007\/978-3-642-28914-9_1"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] M. Bellare and P. Rogaway, \u201cRandom oracles are practical: A paradigm for designing efficient protocols,\u201d ACM CCS'93, pp.62-73, ACM, 1993. 10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] V. Shoup, \u201cLower bounds for discrete logarithms and related problems,\u201d EUROCRYPT'97, LNCS, vol.1233, pp.256-266, Springer, 1997. 10.1007\/3-540-69053-0_18","DOI":"10.1007\/3-540-69053-0_18"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] V. Goyal, \u201cReducing trust in the PKG in identity based cryptosystems,\u201d CRYPTO 2007, LNCS, vol.4622, pp.430-447, Springer, 2007. 10.1007\/978-3-540-74143-5_24","DOI":"10.1007\/978-3-540-74143-5_24"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, \u201cStructure-preserving signatures and commitments to group elements,\u201d CRYPTO 2010, LNCS, vol.6223, pp.209-236, Springer, 2010. 10.1007\/978-3-642-14623-7_12","DOI":"10.1007\/978-3-642-14623-7_12"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] M. Abe, J. Groth, K. Haralambiev, and M. Ohkubo, \u201cOptimal structure-preserving signatures in asymmetric bilinear groups,\u201d CRYPTO 2011, LNCS, vol.6841, pp.649-666, Springer, 2011. 10.1007\/978-3-642-22792-9_37","DOI":"10.1007\/978-3-642-22792-9_37"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] G. Fuchsbauer, C. Hanser, and D. Slamanig, \u201cStructure-preserving signatures on equivalence classes and constant-size anonymous credentials,\u201d J. Cryptol., vol.32, no.2, pp.498-546, 2019. 10.1007\/s00145-018-9281-4","DOI":"10.1007\/s00145-018-9281-4"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] K. Miyazaki, G. Hanaoka, and H. Imai, \u201cDigitally signed document sanitizing scheme based on bilinear maps,\u201d ACM ASIACCS 2006, pp.343-354, ACM, 2006. 10.1145\/1128817.1128868","DOI":"10.1145\/1128817.1128868"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, \u201cAggregate and verifiably encrypted signatures from bilinear maps,\u201d EUROCRYPT 2003, LNCS, vol.2656, pp.416-432, Springer, 2003. 10.1007\/3-540-39200-9_26","DOI":"10.1007\/3-540-39200-9_26"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] R. Gennaro, S. Halevi, and T. Rabin, \u201cSecure hash-and-sign signatures without the random oracle,\u201d EUROCRYPT 1999, LNCS, vol.1592, pp.123-139, Springer, 1999. 10.1007\/3-540-48910-x_9","DOI":"10.1007\/3-540-48910-X_9"},{"key":"29","doi-asserted-by":"publisher","unstructured":"[29] S. Hohenberger and B. Waters, \u201cShort and stateless signatures from the RSA assumption,\u201d CRYPTO 2009, LNCS, vol.5677, pp.654-670, Springer, 2009. 10.1007\/978-3-642-03356-8_38","DOI":"10.1007\/978-3-642-03356-8_38"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] D. Derler, C. Hanser, and D. Slamanig, \u201cRevisiting cryptographic accumulators, additional properties and relations to other primitives,\u201d CT-RSA 2015, LNCS, vol.9048, pp.127-144, Springer, 2015. 10.1007\/978-3-319-16715-2_7","DOI":"10.1007\/978-3-319-16715-2_7"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] J. Groth and A. Sahai, \u201cEfficient non-interactive proof systems for bilinear groups,\u201d EUROCRYPT 2008, ed. N.P. Smart, LNCS, vol.4965, pp.415-432, Springer, 2008. 10.1007\/978-3-540-78967-3_24","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] E. Kiltz, J. Pan, and H. Wee, \u201cStructure-preserving signatures from standard assumptions, revisited,\u201d CRYPTO 2015, Part II, LNCS, vol.9216, pp.275-295, Springer, 2015. 10.1007\/978-3-662-48000-7_14","DOI":"10.1007\/978-3-662-48000-7_14"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] S. Haber, Y. Hatano, Y. Honda, W.G. Horne, K. Miyazaki, T. Sander, S. Tezoku, and D. Yao, \u201cEfficient signature schemes supporting redaction, pseudonymization, and data deidentification,\u201d ACM ASIACCS 2008, pp.353-362, 2008. 10.1145\/1368310.1368362","DOI":"10.1145\/1368310.1368362"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] T. Izu, M. Izumi, N. Kunihiro, and K. Ohta, \u201cYet another sanitizable and deletable signatures,\u201d IEEE WAINA 2011, pp.574-579, 2011. 10.1109\/waina.2011.117","DOI":"10.1109\/WAINA.2011.117"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] T. Izu, N. Kunihiro, K. Ohta, M. Sano, and M. Takenaka, \u201cSanitizable and deletable signature,\u201d WISA 2008, pp.130-144, 2008. 10.1007\/978-3-642-00306-6_10","DOI":"10.1007\/978-3-642-00306-6_10"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] T. Izu, N. Kunihiro, K. Ohta, M. Sano, and M. Takenaka, \u201cYet another sanitizable signature from bilinear maps,\u201d ARES 2009, pp.941-946, 2009. 10.1109\/ares.2009.14","DOI":"10.1109\/ARES.2009.14"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] J. Ma, J. Liu, M. Wang, and W. Wu, \u201cAn efficient and secure design of redactable signature scheme with redaction condition control,\u201d GPC 2017, pp.38-52, 2017. 10.1007\/978-3-319-57186-7_4","DOI":"10.1007\/978-3-319-57186-7_4"},{"key":"38","doi-asserted-by":"publisher","unstructured":"[38] K. Miyazaki, G. Hanaoka, and H. Imai, \u201cInvisibly sanitizable digital signature scheme,\u201d IEICE Trans. Fundamentals, vol.E91-A, no.1, pp.392-402, Jan. 2008. 10.1093\/ietfec\/e91-a.1.392","DOI":"10.1093\/ietfec\/e91-a.1.392"},{"key":"39","doi-asserted-by":"publisher","unstructured":"[39] K. Miyazaki, M. Iwamura, T. Matsumoto, R. Sasaki, H. Yoshiura, S. Tezuka, and H. Imai, \u201cDigitally signed document sanitizing scheme with disclosure condition control,\u201d IEICE Trans. Fundamentals, vol.E88-A, no.1, pp.239-246, Jan. 2005. 10.1093\/ietfec\/e88-a.1.239","DOI":"10.1093\/ietfec\/E88-A.1.239"},{"key":"40","doi-asserted-by":"crossref","unstructured":"[40] E. Kiltz, A. Mityagin, S. Panjwani, and B. Raghavan, \u201cAppend-only signatures,\u201d ICALP 2005, pp.434-445, 2005. 10.1007\/11523468_36","DOI":"10.1007\/11523468_36"},{"key":"41","doi-asserted-by":"crossref","unstructured":"[41] S. Krenn, H.C. P\u00f6hls, K. Samelin, and D. Slamanig, \u201cProtean signature schemes,\u201d CANS 2018, pp.256-276, 2018. 10.1007\/978-3-030-00434-7_13","DOI":"10.1007\/978-3-030-00434-7_13"},{"key":"42","doi-asserted-by":"publisher","unstructured":"[42] A. Escala, G. Herold, E. Kiltz, C. R\u00e0fols, and J.L. Villar, \u201cAn algebraic framework for diffie-hellman assumptions,\u201d CRYPTO 2013, Part II, LNCS, vol.8043, pp.129-147, Springer, 2013. 10.1007\/978-3-642-40084-1_8","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"43","unstructured":"[43] L. Ballard, M. Green, B. de Medeiros, and F. Monrose, \u201cCorrelation-resistant storage via keyword-searchable encryption,\u201d IACR Cryptol. ePrint Arch., vol.2005, p.417, 2005."}],"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\/E104.A\/9\/E104.A_2020DMP0013\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T03:26:02Z","timestamp":1630725962000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0013\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":43,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020dmp0013","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,1]]},"article-number":"2020DMP0013"}}