A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Structural signatures for tree data structures
Proceedings of the VLDB Endowment
Invisibly Sanitizable Digital Signature Scheme
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Security of Sanitizable Signatures Revisited
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Short Redactable Signatures Using Random Trees
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
A New Model for Secure Dissemination of XML Content
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Homomorphic signatures for polynomial functions
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Leakage-free redactable signatures
Proceedings of the second ACM conference on Data and Application Security and Privacy
Computing on authenticated data
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Redactable signatures for independent removal of structure and content
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
On structural signatures for tree data structures
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Computing on authenticated data: new privacy definitions and constructions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Protecting privacy by sanitizing personal data: a new approach to anonymous credentials
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Computing on authenticated data for adjustable predicates
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
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.