{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:17:10Z","timestamp":1743081430589,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319571850"},{"type":"electronic","value":"9783319571867"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57186-7_4","type":"book-chapter","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T11:29:15Z","timestamp":1491996555000},"page":"38-52","source":"Crossref","is-referenced-by-count":10,"title":["An Efficient and Secure Design of Redactable Signature Scheme with Redaction Condition Control"],"prefix":"10.1007","author":[{"given":"Jinhua","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianghua","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"issue":"6","key":"4_CR1","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","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."},{"issue":"195","key":"4_CR3","first-page":"61","volume":"103","author":"K Miyazaki","year":"2003","unstructured":"Miyazaki, K., Susaki, S., Iwamura, M., Matsumoto, T., Sasaki, R., Yoshiura, H.: Digital documents sanitizing problem. Inst. Electron. Inf. Commun. Eng. Tech. Rep. 103(195), 61\u201367 (2003)","journal-title":"Inst. Electron. Inf. Commun. Eng. Tech. Rep."},{"key":"4_CR4","unstructured":"Rivest, R.L.: Two signature schemes. Talk given at Cambridge University, 17 October 2000. http:\/\/people.csail.mit.edu\/rivest\/pubs.html"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology \u2014 CT-RSA 2002","author":"R Johnson","year":"2002","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244\u2013262. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45760-7_17"},{"key":"4_CR6","unstructured":"Becker, G.: Merkle signature schemes, merkle trees and their cryptanalysis. Ruhr-University Bochum, Technical report (2008)"},{"issue":"4","key":"4_CR7","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM (JACM) 33(4), 792\u2013807 (1986)","journal-title":"J. ACM (JACM)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-16715-2_7","volume-title":"Topics in Cryptology \u2014 CT-RSA 2015","author":"D Derler","year":"2015","unstructured":"Derler, D., Hanser, C., Slamanig, D.: Revisiting cryptographic accumulators, additional properties and relations to other primitives. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 127\u2013144. Springer, Cham (2015). doi: 10.1007\/978-3-319-16715-2_7"},{"key":"4_CR9","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). doi: 10.1007\/3-540-45861-1_22"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/11555827_10","volume-title":"Computer Security \u2013 ESORICS 2005","author":"G Ateniese","year":"2005","unstructured":"Ateniese, G., Chou, D.H., Medeiros, B., Tsudik, G.: Sanitizable signatures. In: Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 159\u2013177. Springer, Heidelberg (2005). doi: 10.1007\/11555827_10"},{"issue":"1","key":"4_CR11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1093\/ietfec\/E88-A.1.239","volume":"88","author":"K Miyazaki","year":"2005","unstructured":"Miyazaki, K., Iwamura, M., Matsumoto, T., et al.: Digitally signed document sanitizing scheme with disclosure condition control. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88(1), 239\u2013246 (2005)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"4_CR12","doi-asserted-by":"crossref","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, pp. 343\u2013354. ACM (2006)","DOI":"10.1145\/1128817.1128868"},{"key":"4_CR13","unstructured":"Pohls, H.C., Samelin, K., Posegga, J., et al.: Length-hiding redactable signatures from one-way accumulators in O(n). Technical report MIP-1201, Faculty of Computer Science and Mathematics (FIM), University of Passau (2012)"},{"key":"4_CR14","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 - 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). doi: 10.1007\/978-3-319-30840-1_1"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-00862-7_9","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"E-C Chang","year":"2009","unstructured":"Chang, E.-C., Lim, C.L., Xu, J.: Short redactable signatures using random trees. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 133\u2013147. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00862-7_9"},{"key":"4_CR16","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). doi: 10.1007\/978-3-642-13708-2_6"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kundu, A., Bertino, E.: How to authenticate graphs without leaking. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 609\u2013620. ACM (2010)","DOI":"10.1145\/1739041.1739114"},{"issue":"6","key":"4_CR18","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10207-013-0198-5","volume":"12","author":"A Kundu","year":"2013","unstructured":"Kundu, A., Bertino, E.: Privacy-preserving authentication of trees and graphs. Int. J. Inf. Secur. 12(6), 467\u2013494 (2013)","journal-title":"Int. J. Inf. Secur."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-04897-0_8","volume-title":"Engineering Secure Software and Systems","author":"H Meer","year":"2014","unstructured":"Meer, H., P\u00f6hls, H.C., Posegga, J., Samelin, K.: On the relation between redactable and sanitizable signature schemes. In: J\u00fcrjens, J., Piessens, F., Bielova, N. (eds.) ESSoS 2014. LNCS, vol. 8364, pp. 113\u2013130. Springer, Cham (2014). doi: 10.1007\/978-3-319-04897-0_8"},{"key":"4_CR20","unstructured":"Slamanig, D., Derler, D., Hanser, C., et al. (TUG): Overview of Functional and Malleable Signature Schemes (2015)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45682-1_30"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Eastlake 3rd, D., Jones, P.: US secure hash algorithm 1 (SHA1) (2001)","DOI":"10.17487\/rfc3174"},{"key":"4_CR23","unstructured":"Dang, Q.H.: Secure hash standard. National Institute of Standards and Technology, Gaithersburg, MD, Technical report, August 2015"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1993","author":"J Benaloh","year":"1994","unstructured":"Benaloh, J., Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274\u2013285. Springer, Heidelberg (1994). doi: 10.1007\/3-540-48285-7_24"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"N Bari\u0107","year":"1997","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480\u2013494. Springer, Heidelberg (1997). doi: 10.1007\/3-540-69053-0_33"}],"container-title":["Lecture Notes in Computer Science","Green, Pervasive, and Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57186-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T20:28:23Z","timestamp":1569011303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57186-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319571850","9783319571867"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57186-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}