{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:21:41Z","timestamp":1768339301042,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030932053","type":"print"},{"value":"9783030932060","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-93206-0_12","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T14:04:49Z","timestamp":1639663489000},"page":"190-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Ring Trapdoor Redactable Signatures from Lattice"],"prefix":"10.1007","author":[{"given":"Shaojun","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingmei","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhua","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pp. 99\u2013108. ACM (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"12_CR2","unstructured":"Brakerski, Z., Kalai, Y.T.: A framework for efficient signatures, ring signatures and identity based encryption in the standard model. IACR Cryptology ePrint Archive 2010(086) (2010). http:\/\/eprint.iacr.org\/2010\/086"},{"key":"12_CR3","unstructured":"Brown, J., Blough, D.M.: Verifiable and redactable medical documents. In: AMIA Annual Symposium Proceedings, pp. 1148\u20131157 (2012). https:\/\/www.ncbi.nlm.nih.gov\/pmc\/articles\/PMC3540582\/"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-13708-2_6","volume-title":"Applied Cryptography and Network Security","author":"C Brzuska","year":"2010","unstructured":"Brzuska, C., et al.: Redactable signatures for tree-structured data: definitions and constructions. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol. 6123, pp. 87\u2013104. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13708-2_6"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-00468-1_18","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"C Brzuska","year":"2009","unstructured":"Brzuska, C., et al.: Security of sanitizable signatures revisited. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 317\u2013336. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_18"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-13013-7_26","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C Brzuska","year":"2010","unstructured":"Brzuska, C., Fischlin, M., Lehmann, A., Schr\u00f6der, D.: Unlinkability of sanitizable signatures. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 444\u2013461. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_26"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30840-1_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2015","author":"D Derler","year":"2016","unstructured":"Derler, D., P\u00f6hls, H.C., Samelin, K., Slamanig, D.: A general framework for redactable signatures and new constructions. In: Kwon, S., Yun, A. (eds.) ICISC 2015. LNCS, vol. 9558, pp. 3\u201319. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_1"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing. STOC 2008, pp. 197\u2013206. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-72163-5_6","volume-title":"Information Security Practice and Experience","author":"T Izu","year":"2007","unstructured":"Izu, T., Kunihiro, N., Ohta, K., Takenaka, M., Yoshioka, T.: A sanitizable signature scheme with aggregation. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol. 4464, pp. 51\u201364. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72163-5_6"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) Topics in Cryptology - CT-RSA 2002, pp. 244\u2013262. Springer, Heidelberg (2002). https:\/\/doi.org\/10.5555\/646140.680938","DOI":"10.5555\/646140.680938"},{"issue":"5","key":"12_CR12","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1002\/sec.346","volume":"5","author":"S Lim","year":"2012","unstructured":"Lim, S., Lee, E., Park, C.M.: A short redactable signature scheme using pairing. Secur. Commun. Netw. 5(5), 523\u2013534 (2012). https:\/\/doi.org\/10.1002\/sec.346","journal-title":"Secur. Commun. Netw."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"621","DOI":"10.4218\/etrij.11.0110.0530","volume":"33","author":"S Lim","year":"2011","unstructured":"Lim, S., Lee, H.S.: A short and efficient redactable signature based on RSA 33, 621\u2013628 (2011). https:\/\/doi.org\/10.4218\/etrij.11.0110.0530","journal-title":"A short and efficient redactable signature based on RSA"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Liu, J., Ma, J., Xiang, Y., Zhou, W., Huang, X.: Authenticated medical documents releasing with privacy protection and release control. IEEE Trans. Dependable Secure Comput., 1 (2019). https:\/\/doi.org\/10.1109\/TDSC.2019.2892446","DOI":"10.1109\/TDSC.2019.2892446"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-98989-1_9","volume-title":"Computer Security","author":"J Liu","year":"2018","unstructured":"Liu, J., Ma, J., Zhou, W., Xiang, Y., Huang, X.: Dissemination of authenticated tree-structured data with privacy protection and fine-grained control in outsourced databases. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11099, pp. 167\u2013186. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98989-1_9"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Ma, J., Huang, X., Mu, Y., Deng, R.H.: Authenticated data redaction with accountability and transparency. IEEE Trans. Dependable Secure Comput., 1 (2020). https:\/\/doi.org\/10.1109\/TDSC.2020.2998135","DOI":"10.1109\/TDSC.2020.2998135"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1109\/TETC.2017.2754646","volume":"8","author":"J Ma","year":"2020","unstructured":"Ma, J., Liu, J., Huang, X., Xiang, Y., Wu, W.: Authenticated data redaction with fine-grained control. IEEE Trans. Emerg. Top. Comput. 8(2), 291\u2013302 (2020). https:\/\/doi.org\/10.1109\/TETC.2017.2754646","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-57186-7_4","volume-title":"Green, Pervasive, and Cloud Computing","author":"J Ma","year":"2017","unstructured":"Ma, J., Liu, J., Wang, M., Wu, W.: An efficient and secure design of redactable signature scheme with redaction condition control. In: Au, M.H.A., Castiglione, A., Choo, K.-K.R., Palmieri, F., Li, K.-C. (eds.) GPC 2017. LNCS, vol. 10232, pp. 38\u201352. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57186-7_4"},{"key":"12_CR19","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-662-44791-8_10","volume-title":"E-Business and Telecommunications","author":"H de Meer","year":"2014","unstructured":"de Meer, H., P\u00f6hls, H.C., Posegga, J., Samelin, K.: Redactable signature schemes for trees with signer-controlled non-leaf-redactions. In: Obaidat, M.S., Filipe, J. (eds.) ICETE 2012. CCIS, vol. 455, pp. 155\u2013171. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44791-8_10"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","journal-title":"SIAM J. Comput."},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Miyazaki, K., et al.: Digitally signed document sanitizing scheme with disclosure condition control. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A, 239\u2013246 (2005). https:\/\/doi.org\/10.1093\/ietfec\/E88-A.1.239","DOI":"10.1093\/ietfec\/E88-A.1.239"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Miyazaki, K., Hanaoka, G., Imai, H.: Digitally signed document sanitizing scheme based on bilinear maps. In: Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2006, pp. 343\u2013354, Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1128817.1128868","DOI":"10.1145\/1128817.1128868"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-04474-8_26","volume-title":"Information Security","author":"R Nojima","year":"2009","unstructured":"Nojima, R., Tamura, J., Kadobayashi, Y., Kikuchi, H.: A storage efficient redactable signature in the standard model. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 326\u2013337. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04474-8_26"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-10329-7_6","volume-title":"Smart Grid Security","author":"HC P\u00f6hls","year":"2014","unstructured":"P\u00f6hls, H.C., Karwe, M.: Redactable signatures to control the maximum noise for differential privacy in the smart grid. In: Cuellar, J. (ed.) SmartGridSec 2014. LNCS, vol. 8448, pp. 79\u201393. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10329-7_6"},{"key":"12_CR26","unstructured":"P\u00f6hls, H.C., Samelin, K., Posegga, J., De Meer, H.: Length-hiding redactable signatures from one-way accumulators in $$O(n)$$. Technical report MIP-1201, Faculty of Computer Science and Mathematics (FIM...) (2012)"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"P\u00f6hls, H.C., Samelin, K.: Accountable redactable signatures. In: 2015 10th International Conference on Availability, Reliability and Security, pp. 60\u201369, August 2015. https:\/\/doi.org\/10.1109\/ARES.2015.10","DOI":"10.1109\/ARES.2015.10"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-030-45388-6_22","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"O Sanders","year":"2020","unstructured":"Sanders, O.: Efficient redactable signature and application to anonymous credentials. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 628\u2013656. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_22"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-13241-4_19","volume-title":"Communications and Multimedia Security","author":"D Slamanig","year":"2010","unstructured":"Slamanig, D., Rass, S.: Generalizations and extensions of redactable signatures with applications to electronic healthcare. In: De Decker, B., Schaum\u00fcller-Bichl, I. (eds.) CMS 2010. LNCS, vol. 6109, pp. 201\u2013213. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13241-4_19"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45861-1_22","volume-title":"Information Security and Cryptology \u2014 ICISC 2001","author":"R Steinfeld","year":"2002","unstructured":"Steinfeld, R., Bull, L., Zheng, Y.: Content extraction signatures. In: Kim, K. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 285\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45861-1_22"},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Zuo, F., Wang, Q., Cheng, P.: Identity-based redactable Lamport signature scheme. J. Phys. Conf. Ser. 1314, 012147 (2019). https:\/\/doi.org\/10.1088\/1742-6596\/1314\/1\/012147","DOI":"10.1088\/1742-6596\/1314\/1\/012147"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93206-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T06:04:22Z","timestamp":1643004262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93206-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030932053","9783030932060"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93206-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISPEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security Practice and Experience","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ispec2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ispec2021.nuist.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Doble peer review","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}