Redactable Signatures for Tree-Structured Data: Definitions and Constructions

Christina Brzuska; Heike Busch; Oezguer Dagdelen; Marc Fischlin; Martin Franz; Stefan Katzenbeisser; Mark Manulis; Cristina Onete; Andreas Peter; Bertram Poettering; Dominique Schroeder

Redactable Signatures for Tree-Structured Data: Definitions and Constructions

Christina Brzuska^*, Heike Busch, Oezguer Dagdelen, Marc Fischlin, Martin Franz, Stefan Katzenbeisser, Mark Manulis, Cristina Onete, Andreas Peter, Bertram Poettering, Dominique Schroeder

^*Corresponding author for this work

Not published at Aalto University

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

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.

Original language	English
Title of host publication	APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
Editors	J Zhou, M Yung
Publisher	Springer
Pages	87-104
Number of pages	18
ISBN (Print)	978-3-642-13707-5
Publication status	Published - 2010
MoE publication type	A4 Conference publication
Event	International Conference on Applied Cryptography and Network Security - Beijing, China Duration: 22 Jun 2010 → 25 Jun 2010 Conference number: 8

Publication series

Name	Lecture Notes in Computer Science
Publisher	SPRINGER-VERLAG BERLIN
Volume	6123
ISSN (Print)	0302-9743

Conference

Conference	International Conference on Applied Cryptography and Network Security
Abbreviated title	ACNS
Country/Territory	China
City	Beijing
Period	22/06/2010 → 25/06/2010

Cite this

Brzuska, C., Busch, H., Dagdelen, O., Fischlin, M., Franz, M., Katzenbeisser, S., Manulis, M., Onete, C., Peter, A., Poettering, B., & Schroeder, D. (2010). Redactable Signatures for Tree-Structured Data: Definitions and Constructions. In J. Zhou, & M. Yung (Eds.), APPLIED CRYPTOGRAPHY AND NETWORK SECURITY (pp. 87-104). (Lecture Notes in Computer Science; Vol. 6123). Springer.

@inproceedings{08c01bb8fb9a48d88abc9bc3f277f22b,

title = "Redactable Signatures for Tree-Structured Data: Definitions and Constructions",

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.",

author = "Christina Brzuska and Heike Busch and Oezguer Dagdelen and Marc Fischlin and Martin Franz and Stefan Katzenbeisser and Mark Manulis and Cristina Onete and Andreas Peter and Bertram Poettering and Dominique Schroeder",

year = "2010",

language = "English",

isbn = "978-3-642-13707-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "87--104",

editor = "J Zhou and M Yung",

booktitle = "APPLIED CRYPTOGRAPHY AND NETWORK SECURITY",

address = "Germany",

note = "International Conference on Applied Cryptography and Network Security, ACNS ; Conference date: 22-06-2010 Through 25-06-2010",

}

Brzuska, C, Busch, H, Dagdelen, O, Fischlin, M, Franz, M, Katzenbeisser, S, Manulis, M, Onete, C, Peter, A, Poettering, B & Schroeder, D 2010, Redactable Signatures for Tree-Structured Data: Definitions and Constructions. in J Zhou & M Yung (eds), APPLIED CRYPTOGRAPHY AND NETWORK SECURITY. Lecture Notes in Computer Science, vol. 6123, Springer, pp. 87-104, International Conference on Applied Cryptography and Network Security, Beijing, China, 22/06/2010.

Redactable Signatures for Tree-Structured Data: Definitions and Constructions. / Brzuska, Christina; Busch, Heike; Dagdelen, Oezguer et al.
APPLIED CRYPTOGRAPHY AND NETWORK SECURITY. ed. / J Zhou; M Yung. Springer, 2010. p. 87-104 (Lecture Notes in Computer Science; Vol. 6123).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Redactable Signatures for Tree-Structured Data

T2 - International Conference on Applied Cryptography and Network Security

AU - Brzuska, Christina

AU - Busch, Heike

AU - Dagdelen, Oezguer

AU - Fischlin, Marc

AU - Franz, Martin

AU - Katzenbeisser, Stefan

AU - Manulis, Mark

AU - Onete, Cristina

AU - Peter, Andreas

AU - Poettering, Bertram

AU - Schroeder, Dominique

N1 - Conference code: 8

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

M3 - Conference article in proceedings

SN - 978-3-642-13707-5

T3 - Lecture Notes in Computer Science

SP - 87

EP - 104

BT - APPLIED CRYPTOGRAPHY AND NETWORK SECURITY

A2 - Zhou, J

A2 - Yung, M

PB - Springer

Y2 - 22 June 2010 through 25 June 2010

ER -

Redactable Signatures for Tree-Structured Data: Definitions and Constructions

Abstract

Publication series

Conference

Fingerprint

Cite this