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

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-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 languageEnglish
Title of host publicationAPPLIED CRYPTOGRAPHY AND NETWORK SECURITY
EditorsJ Zhou, M Yung
PublisherSpringer
Pages87-104
Number of pages18
ISBN (Print)978-3-642-13707-5
Publication statusPublished - 2010
MoE publication typeA4 Conference publication
EventInternational Conference on Applied Cryptography and Network Security - Beijing, China
Duration: 22 Jun 201025 Jun 2010
Conference number: 8

Publication series

NameLecture Notes in Computer Science
PublisherSPRINGER-VERLAG BERLIN
Volume6123
ISSN (Print)0302-9743

Conference

ConferenceInternational Conference on Applied Cryptography and Network Security
Abbreviated titleACNS
Country/TerritoryChina
CityBeijing
Period22/06/201025/06/2010

Fingerprint

Dive into the research topics of 'Redactable Signatures for Tree-Structured Data: Definitions and Constructions'. Together they form a unique fingerprint.

Cite this