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 | Undefined |
---|---|
Pages | 87-104 |
Number of pages | 18 |
DOIs | |
Publication status | Published - 25 Jun 2010 |
Event | 8th International Conference on Applied Cryptography and Network Security, ACNS 2010 - Beijing, China Duration: 22 Jun 2010 → 25 Jun 2010 |
Conference
Conference | 8th International Conference on Applied Cryptography and Network Security, ACNS 2010 |
---|---|
Period | 22/06/10 → 25/06/10 |
Other | 22-25 June 2010 |
Keywords
- SCS-Cybersecurity
- EWI-23759
- Signatures
- Redactable
- Definitions
- Constructions
- IR-87352
- Tree-Structured