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
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6123)

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.

References

  1. 1.
    Ateniese, G., Chou, D.H., de Medeiros, B., Tsudik, G.: Sanitizable signatures. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 159–177. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Brzuska, C., Fischlin, M., Freudenreich, T., Lehmann, A., Page, M., Schelbert, J., Schröder, D., Volk, F.: Security of San-itizable Signatures Revisited. In: Jarecki, S., Tsudik, G. (eds.) Public Key Cryptography – PKC 2009. LNCS, vol. 5443, pp. 317–336. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Bertino, E., Kundu, A.: A New Model for Secure Dissemination of XML Content. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 38, 292–301 (2008)CrossRefGoogle Scholar
  4. 4.
    Chang, E.-C., Lim, C.L., Xu, J.: Short Redactable Signatures Using Random Trees. Cryptology ePrint Archive, Report 2009/025 (2009), http://eprint.iacr.org/; A preliminary version has appeared at Fischlin, M. (ed.): CT-RSA 2009. LNCS, vol. 5473. Springer, Heidelberg (2009)
  5. 5.
    Goldwasser, S., Micali, S., Rivest, R.L.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2), 281–308 (1988)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kundu, A., Bertino, E.: Structural signatures for tree data structures. Proceedings of the VLDB Endowment 1(1), 138–150 (2008)Google Scholar
  7. 7.
    Kundu, A., Bertino, E.: Leakage-Free Integrity Assurance for Tree Data Structures. Technical Report 2009-1, CERIAS (2009)Google Scholar
  8. 8.
    Miyazaki, K., Hanaoka, G., Imai, H.: Invisibly Sanitizable Digital Signature Scheme. IEICE Transactions 91-A(1), 392–402 (2008)Google Scholar
  9. 9.
    Miyazaki, K., Susaki, S., Iwamura, M., Matsumoto, T., Sasaki, R., Yoshiura, H.: Digital documents sanitizing problem. Technical Report ISEC2003-20. IEICE (2003)Google Scholar
  10. 10.
    Steinfeld, R., Bull, L., Zheng, Y.: Content extraction signatures. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 285–304. Springer, Heidelberg (2002)CrossRefGoogle Scholar

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 

Personalised recommendations