Redactable Signatures for Tree-Structured Data: Definitions and Constructions
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. Kun(lu and Bertino also provide a construc tion, 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 crypto graphic assumptions.
Christina Brzuska Heike Busch Oezguer Dagdelen Marc Fischlin Martin Franz Stcfan Katzenbeisser Mark Manulis Cristina Oncte
Technical University of Darmstadt Center for Advanced Security Research Darmstadt (CASED) Technical University of Darmstadt Center for Advanced Security Research Darmstadt (CASED)Andreas Pet
国际会议
8th International Conference,ACNS 2010(第八届国际应用密码与网络安全大会)
北京
英文
87-104
2010-06-22（万方平台首次上网日期，不代表论文的发表时间）