On structural signatures for tree data structures

  • Authors:
  • Kai Samelin;Henrich C. Pöhls;Arne Bilzhause;Joachim Posegga;Hermann de Meer

  • Affiliations:
  • Chair of Computer Networks and Computer Communication, University of Passau, Germany;Chair of IT-Security, Institute of IT-Security and Security Law (ISL), University of Passau, Germany;Chair of IT-Security, Institute of IT-Security and Security Law (ISL), University of Passau, Germany;Chair of IT-Security, Institute of IT-Security and Security Law (ISL), University of Passau, Germany;Chair of Computer Networks and Computer Communication, University of Passau, Germany

  • Venue:
  • ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present new attacks on the redactable signature scheme introduced by Kundu and Bertino at VLDB '08. This extends the work done by Brzuska et al. at ACNS '10 and Samelin et al. at ISPEC '12. The attacks address unforgeability, transparency and privacy. Based on the ideas of Kundu and Bertino, we introduce a new provably secure construction. The corresponding security model is more flexible than the one introduced by Brzuska et al. Moreover, we have implemented the schemes introduced by Brzuska et al. and Kundu and Bertino. The practical evaluation shows that schemes with a quadratic complexity become unuseable very fast.