{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:24:26Z","timestamp":1773512666467,"version":"3.50.1"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030401856","type":"print"},{"value":"9783030401863","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-40186-3_23","type":"book-chapter","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T00:03:52Z","timestamp":1581638632000},"page":"538-563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Policy-Based Sanitizable Signatures"],"prefix":"10.1007","author":[{"given":"Kai","family":"Samelin","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Slamanig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,14]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s00145-014-9182-0","volume":"28","author":"JH Ahn","year":"2015","unstructured":"Ahn, J.H., et al.: Computing on authenticated data. J. Cryptol. 28, 2 (2015). https:\/\/doi.org\/10.1007\/s00145-014-9182-0","journal-title":"J. Cryptol."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Benhamouda, F., MacKenzie, P.: Security of the J-PAKE password-authenticated key exchange protocol. In: 2015 IEEE Symposium on Security and Privacy (SP 2015), pp. 571\u2013587 (2015)","DOI":"10.1109\/SP.2015.41"},{"key":"23_CR3","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., et al.: Sanitizable signatures. ESORICS 2005. LNCS, vol. 3679, pp. 159\u2013177. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_10"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-36362-7_20","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"M Abe","year":"2013","unstructured":"Abe, M., et al.: Tagged one-time signatures: tight security and optimal tag size. PKC 2013. LNCS, vol. 7778, pp. 312\u2013331. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_20"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-30598-9_12","volume-title":"Security in Communication Networks","author":"G Ateniese","year":"2005","unstructured":"Ateniese, G., de Medeiros, B.: On the key exposure problem in chameleon hashes. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 165\u2013179. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30598-9_12"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-14623-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"M Abe","year":"2010","unstructured":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 209\u2013236. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_12"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Magri, B., Venturi, D., Andrade, E.R..: Redactable blockchain - or - rewriting history in bitcoin and friends. In: EuroS&P, pp. 111\u2013126 (2017)","DOI":"10.1109\/EuroSP.2017.37"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-319-60055-0_23","volume-title":"Information Security and Privacy","author":"MT Beck","year":"2017","unstructured":"Beck, M.T., et al.: Practical strongly invisible and strongly accountable sanitizable signatures. ACISP 2017. LNCS, vol. 10342, pp. 437\u2013452. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60055-0_23"},{"key":"23_CR9","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. PKC 2009. LNCS, vol. 5443, pp. 317\u2013336. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_18"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-00468-1_5","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"D Boneh","year":"2009","unstructured":"Boneh, D., et al.: Signing a linear subspace: signature schemes for network coding. PKC 2009. LNCS, vol. 5443, pp. 68\u201387. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_5"},{"key":"23_CR11","unstructured":"Brzuska, C., Fischlin, M., Lehmann, A., Schr\u00f6der, D..: Santizable signatures: how to partially delegate control for authenticated data. In: BIOSIG, pp. 117\u2013128 (2009)"},{"key":"23_CR12","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., et al.: Unlinkability of sanitizable signatures. PKC 2010. LNCS, vol. 6056, pp. 444\u2013461. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_26"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-02641-7_10","volume-title":"Cryptology and Network Security","author":"X Bultel","year":"2018","unstructured":"Bultel, X., Lafourcade, P.: Unlinkable and strongly accountable sanitizable signatures from verifiable ring signatures. In: Capkun, S., Chow, S.S.M. (eds.) CANS 2017. LNCS, vol. 11261, pp. 203\u2013226. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02641-7_10"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Bultel, X., et al.: Efficient invisible and unlinkable sanitizable signatures. PKC 2019, Part 1. LNCS, vol. 11442, pp. 159\u2013189. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_6","DOI":"10.1007\/978-3-030-17253-4_6"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","volume":"16","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one-more-RSA-inversion problems and the security of Chaum\u2019s blind signature scheme. J. Cryptol. 16(3), 185\u2013215 (2003). https:\/\/doi.org\/10.1007\/s00145-002-0120-1","journal-title":"J. Cryptol."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-40012-4_12","volume-title":"Public Key Infrastructures, Services and Applications","author":"C Brzuska","year":"2013","unstructured":"Brzuska, C., P\u00f6hls, H.C., Samelin, K.: Non-interactive public accountability for sanitizable signatures. In: De Capitani di Vimercati, S., Mitchell, C. (eds.) EuroPKI 2012. LNCS, vol. 7868, pp. 178\u2013193. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40012-4_12"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-53997-8_2","volume-title":"Public Key Infrastructures, Services and Applications","author":"C Brzuska","year":"2014","unstructured":"Brzuska, C., P\u00f6hls, H.C., Samelin, K.: Efficient and perfectly unlinkable sanitizable signatures without group signatures. In: Katsikas, S., Agudo, I. (eds.) EuroPKI 2013. LNCS, vol. 8341, pp. 12\u201330. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-53997-8_2"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Bilzhause, A., P\u00f6hls, H.C., Samelin, K.: Position paper: the past, present, and future of sanitizable and redactable signatures. In: Ares, pp. 87:1\u201387:9 (2017)","DOI":"10.1145\/3098954.3104058"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: CCS, 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: 2007 IEEE Symposium on Security and Privacy (SP 2007), pp. 321\u2013334 (2007)","DOI":"10.1109\/SP.2007.11"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-30574-3_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M Bellare","year":"2005","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: the case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 136\u2013153. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_11"},{"key":"23_CR22","doi-asserted-by":"publisher","unstructured":"Camenisch, J., et al.: Chameleon-hashes with ephemeral trapdoors - and applications to invisible sanitizable signatures. In: PKC, Part II (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_6","DOI":"10.1007\/978-3-662-54388-7_6"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-11925-5_13","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"S Canard","year":"2010","unstructured":"Canard, S., Jambert, A.: On extended sanitizable signature schemes. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 179\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11925-5_13"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-31410-0_3","volume-title":"Progress in Cryptology - AFRICACRYPT 2012","author":"S Canard","year":"2012","unstructured":"Canard, S., Jambert, A., Lescuyer, R.: Sanitizable signatures with several signers and sanitizers. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol. 7374, pp. 35\u201352. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31410-0_3"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-68914-0_16","volume-title":"Applied Cryptography and Network Security","author":"S Canard","year":"2008","unstructured":"Canard, S., et al.: Trapdoor sanitizable signatures and their application to content protection. ACNS 2008. LNCS, vol. 5037, pp. 258\u2013276. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68914-0_16"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"J Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052252"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13\u201325. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055717"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"23_CR29","unstructured":"Demirel, D., et al.: PRISMACLOUD D4.4: overview of functional and malleable signature schemes. Technical report, H2020 Prismacloud (2015). www.prismacloud.eu"},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-17373-8_35","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"Y Dodis","year":"2010","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Efficient public-key cryptography in the presence of key leakage. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 613\u2013631. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_35"},{"key":"23_CR31","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 De Meer","year":"2014","unstructured":"De Meer, H., et al.: On the relation between redactable and sanitizable signature schemes. ESSoS 2014. LNCS, vol. 8364, pp. 113\u2013130. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04897-0_8"},{"key":"23_CR32","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., et al.: A general framework for redactable signatures and new constructions. ICISC 2015. LNCS, vol. 9558, pp. 3\u201319. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_1"},{"key":"23_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-26059-4_25","volume-title":"Provable Security","author":"D Derler","year":"2015","unstructured":"Derler, D., Slamanig, D.: Rethinking privacy for extended sanitizable signatures and a black-box construction of strongly private schemes. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. 455\u2013474. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26059-4_25"},{"issue":"6","key":"23_CR34","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1007\/s10623-018-0535-9","volume":"87","author":"D Derler","year":"2019","unstructured":"Derler, D., Slamanig, D.: Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge. Des. Codes Cryptogr. 87(6), 1373\u20131413 (2019). https:\/\/doi.org\/10.1007\/s10623-018-0535-9","journal-title":"Des. Codes Cryptogr."},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Derler, D., Samelin, K., Slamanig, D., Striecks, C.: Fine-grained and controlled rewriting in blockchains: chameleon-hashing gone attribute-based. In: NDSS (2019)","DOI":"10.14722\/ndss.2019.23066"},{"key":"23_CR36","unstructured":"Fehr, V., Fischlin, M.: Sanitizable signcryption: sanitization over encrypted data (full version) (2015, ePrint)"},{"key":"23_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-93387-0_11","volume-title":"Applied Cryptography and Network Security","author":"M Fischlin","year":"2018","unstructured":"Fischlin, M., Harasser, P.: Invisible sanitizable signatures and public-key encryption are equivalent. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 202\u2013220. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_11"},{"key":"23_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-662-49384-7_12","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"N Fleischhacker","year":"2016","unstructured":"Fleischhacker, N., et al.: Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys. PKC 2016. LNCS, vol. 9614, pp. 301\u2013330. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49384-7_12"},{"key":"23_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-34931-7_5","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"S Faust","year":"2012","unstructured":"Faust, S., et al.: On the non-malleability of the Fiat-Shamir transform. INDOCRYPT 2012. LNCS, vol. 7668, pp. 60\u201379. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_5"},{"key":"23_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-319-44618-9_12","volume-title":"Security and Cryptography for Networks","author":"E Ghosh","year":"2016","unstructured":"Ghosh, E., et al.: Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees. SCN 2016. LNCS, vol. 9841, pp. 216\u2013236. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_12"},{"key":"23_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-21518-6_21","volume-title":"Information Security and Cryptology","author":"J gong","year":"2011","unstructured":"gong, J., et al.: Fully-secure and practical sanitizable signatures. Inscrypt 2010. LNCS, vol. 6584, pp. 300\u2013317. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21518-6_21"},{"key":"23_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J Groth","year":"2006","unstructured":"Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444\u2013459. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_29"},{"key":"23_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-662-48797-6_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"J Groth","year":"2015","unstructured":"Groth, J.: Efficient fully structure-preserving signatures for large messages. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 239\u2013259. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_11"},{"key":"23_CR44","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). https:\/\/doi.org\/10.1007\/3-540-45760-7_17"},{"key":"23_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-89339-6_2","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"S Krenn","year":"2018","unstructured":"Krenn, S., et al.: Chameleon-hashes with dual long-term trapdoors and their applications. AFRICACRYPT 2018. LNCS, vol. 10831, pp. 11\u201332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_2"},{"key":"23_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-00434-7_13","volume-title":"Cryptology and Network Security","author":"S Krenn","year":"2018","unstructured":"Krenn, S., et al.: Protean signature schemes. CANS 2018. LNCS, vol. 11124, pp. 256\u2013276. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00434-7_13"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Krenn, S., P\u00f6hls, H.C., Samelin, K., Slamanig, D.: Fully invisible protean signatures schemes (2019, ePrint)","DOI":"10.1007\/978-3-030-00434-7_13"},{"key":"23_CR48","unstructured":"Krawczyk, H., Rabin, T.: Chameleon signatures. In: NDSS, pp. 143\u2013154 (2000)"},{"key":"23_CR49","doi-asserted-by":"publisher","unstructured":"Krenn, S., Samelin, K., Sommer, D.: Stronger security for sanitizable signatures. In: DPM\/QASA, pp. 100\u2013117 (2015). https:\/\/doi.org\/10.1007\/978-3-319-29883-2_7","DOI":"10.1007\/978-3-319-29883-2_7"},{"key":"23_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-38033-4_9","volume-title":"Information Security Practice and Experience","author":"J Lai","year":"2013","unstructured":"Lai, J., Ding, X., Wu, Y.: Accountable trapdoor sanitizable signatures. In: Deng, R.H., Feng, T. (eds.) ISPEC 2013. LNCS, vol. 7863, pp. 117\u2013131. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38033-4_9"},{"key":"23_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-13190-5_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A Lewko","year":"2010","unstructured":"Lewko, A., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 62\u201391. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_4"},{"key":"23_CR52","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":"23_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-642-30057-8_42","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"Y Sakai","year":"2012","unstructured":"Sakai, Y., et al.: On the security of dynamic group signatures: preventing signature hijacking. PKC 2012. LNCS, vol. 7293, pp. 715\u2013732. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_42"},{"key":"23_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-19379-8_5","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"S Yamada","year":"2011","unstructured":"Yamada, S., et al.: Generic constructions for chosen-ciphertext secure attribute based encryption. PKC 2011. LNCS, vol. 6571, pp. 71\u201389. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_5"},{"key":"23_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-13708-2_4","volume-title":"Applied Cryptography and Network Security","author":"DH Yum","year":"2010","unstructured":"Yum, D.H., Seo, J.W., Lee, P.J.: Trapdoor sanitizable signatures made easy. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol. 6123, pp. 53\u201368. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13708-2_4"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40186-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:47:05Z","timestamp":1710269225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40186-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030401856","9783030401863"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40186-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"secure.iacr.org\/websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","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":"28","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":"29% - 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,25","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":"9","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}