Redactable signatures for tree-structured data: Definitions and constructions
Brzuska C, Schröder H, Dagdelen Ö, Fischlin M, Franz M, Katzenbeisser S, Manulis M, Onete C, Peter A, Poettering B, Schröder D (2010)
Publication Status: Published
Publication Type: Authored book, Volume of book series
Publication year: 2010
Series: Applied Cryptography and Network Security, ACNS 2010
Pages Range: 87-104
Event location: Beijing
ISBN: 9783642137075
DOI: 10.1007/978-3-642-13708-2_6
Abstract
Kundu and Bertino (VLDB 2008) recently introduced the idea of structural signatures for trees which support public redaction of subtrees (by third-party distributors) while pertaining the integrity of the remaining parts. An example is given by signed XML documents of which parts should be sanitized before being published by a distributor not holding the signing key. Kundu and Bertino also provide a construction, but fall short of providing formal security definitions and proofs. Here we revisit their work and give rigorous security models for the redactable signatures for tree-structured data, relate the notions, and give a construction that can be proven secure under standard cryptographic assumptions. © 2010 Springer-Verlag Berlin Heidelberg.
Authors with CRIS profile
Involved external institutions
Germany (DE)How to cite
APA:
Brzuska, C., Schröder, H., Dagdelen, Ö., Fischlin, M., Franz, M., Katzenbeisser, S.,... Schröder, D. (2010). Redactable signatures for tree-structured data: Definitions and constructions.
MLA:
Brzuska, Chris, et al. Redactable signatures for tree-structured data: Definitions and constructions. 2010.
BibTeX: Download