{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T06:05:16Z","timestamp":1746857116260,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031209734"},{"type":"electronic","value":"9783031209741"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20974-1_18","type":"book-chapter","created":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T08:06:38Z","timestamp":1668067598000},"page":"339-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Redacting Blockchain Without Exposing Chameleon Hash Collisions"],"prefix":"10.1007","author":[{"given":"Thiago Leucz","family":"Astrizi","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Cust\u00f3dio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,10]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Astrizi, T., Cust\u00f3dio, R., Moura, L.: Post-quantum signature with preimage chameleon hashing. In: XX Simp\u00f3sio Brasileiro de Seguran\u00e7a da Informa\u00e7\u00e3o e de Sistemas Computacionais. SBC, Av. Getulio Vargas, 333 (2020)","DOI":"10.5753\/sbseg.2020.19228"},{"key":"18_CR2","unstructured":"Astrizi, T.L.: Repository with the tests (2022). https:\/\/github.com\/thiagoharry\/blockchain_tests"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Magri, B., Venturi, D., Andrade, E.: Redactable blockchain-or-rewriting history in bitcoin and friends. In: 2017 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 111\u2013126. IEEE (2017)","DOI":"10.1109\/EuroSP.2017.37"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-27809-2_19","volume-title":"Financial Cryptography","author":"G Ateniese","year":"2004","unstructured":"Ateniese, G., de Medeiros, B.: Identity-based chameleon hash and applications. In: Financial Cryptography, LNCS 3110. pp. 164\u2013180. Springer, Berlin, Heidelberg (2004)."},{"key":"18_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: International Conference on Security in Communication Networks. pp. 165\u2013179. Springer (2004)"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s00145-013-9155-8","volume":"27","author":"M Bellare","year":"2014","unstructured":"Bellare, M., Ristov, T.: A characterization of chameleon hash functions and new, efficient designs. Journal of cryptology 27(4), 799\u2013823 (2014)","journal-title":"J. Cryptol."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-662-46447-2_12","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"O Blazy","year":"2015","unstructured":"Blazy, O., Kakvi, S.A., Kiltz, E., Pan, J.: Tightly-secure signatures from chameleon hash functions. In: Public-Key Cryptography - PKC 2015, LNCS 9020. pp. 256\u2013279. Springer, Berlin, Heidelberg (2015)."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Annual international conference on the theory and applications of cryptographic techniques. pp. 523\u2013552. Springer (2010)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-30144-8_8","volume-title":"Information Security","author":"X Chen","year":"2004","unstructured":"Chen, X., Zhang, F., Kim, K.: Chameleon hashing without key exposure. In: International Conference on Information Security. pp. 87\u201398. Springer (2004)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Derler, D., Samelin, K., Slamanig, D.: Bringing order to chaos: the case of collision-resistant chameleon-hashes. In: Public Key Cryptography (1), pp. 462\u2013492 (2020)","DOI":"10.1007\/978-3-030-45374-9_16"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Deuber, D., Magri, B., Thyagarajan, S.A.K.: Redactable blockchain in the permissionless setting. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 124\u2013138. IEEE (2019)","DOI":"10.1109\/SP.2019.00039"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-44371-2_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Micciancio, D.: Improved short lattice signatures in the standard model. In: Annual Cryptology Conference. pp. 335\u2013352. Springer (2014)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-662-43414-7_3","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"R El Bansarkhani","year":"2014","unstructured":"El Bansarkhani, R., Buchmann, J.: Improvement and Efficient Implementation of a Lattice-Based Signature Scheme. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 48\u201367. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_3"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: Analysis and applications. In: Annual international conference on the theory and applications of cryptographic techniques. pp. 281\u2013310. Springer (2015)"},{"key":"18_CR15","doi-asserted-by":"crossref","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, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"18_CR16","unstructured":"Krawczyk, H., Rabin, T.: Chameleon hashing and signatures. IACR Cryptol. ePrint Arch. 1998, 10 (1998)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-21568-2_6","volume-title":"Applied Cryptography and Network Security","author":"X Lu","year":"2019","unstructured":"Lu, X., Au, M.H., Zhang, Z.: Raptor: a practical lattice-based (linkable) ring signature. In: International Conference on Applied Cryptography and Network Security. pp. 110\u2013130. Springer (2019)"},{"key":"18_CR18","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: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 700\u2013718. Springer (2012)"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-19574-7_21","volume-title":"Selected Areas in Cryptography","author":"P Mohassel","year":"2011","unstructured":"Mohassel, P.: One-time signatures and chameleon hash functions. In: Selected Areas in Cryptography, LNCS 6544. pp. 302\u2013319. Springer, Berlin, Heidelberg (2011)."},{"key":"18_CR20","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review, p. 21260 (2008)"},{"key":"18_CR21","unstructured":"Rohloff, K., Cousins, D., Polyakov, Y.: PALISADE Lattice Cryptography Library (release 1.11.7), April 2022. https:\/\/palisade-crypto.org\/"},{"issue":"9","key":"18_CR22","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1002\/int.22502","volume":"36","author":"D Zhang","year":"2021","unstructured":"Zhang, D., Le, J., Lei, X., Xiang, T., Liao, X.: Exploring the redaction mechanisms of mutable blockchains: A comprehensive survey. International Journal of Intelligent Systems 36(9), 5051\u20135084 (2021)","journal-title":"Int. J. Intell. Syst."}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20974-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T20:04:39Z","timestamp":1672344279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20974-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031209734","9783031209741"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20974-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cans2022.com\/","order":11,"name":"conference_url","label":"Conference URL","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","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":"18","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":"2","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":"33% - 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":"3-4","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)"}}]}}