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 Schröder
Conference paper

DOI: 10.1007/978-3-642-13708-2_6

Volume 6123 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Brzuska C. et al. (2010) Redactable Signatures for Tree-Structured Data: Definitions and Constructions. In: Zhou J., Yung M. (eds) Applied Cryptography and Network Security. ACNS 2010. Lecture Notes in Computer Science, vol 6123. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Christina Brzuska
    • 1
  • Heike Busch
    • 1
  • Oezguer Dagdelen
    • 1
  • Marc Fischlin
    • 1
  • Martin Franz
    • 1
  • Stefan Katzenbeisser
    • 1
  • Mark Manulis
    • 1
  • Cristina Onete
    • 1
  • Andreas Peter
    • 1
  • Bertram Poettering
    • 1
  • Dominique Schröder
    • 1
  1. 1.Center for Advanced Security Research Darmstadt (CASED)Technical University of Darmstadt