2012 | OriginalPaper | Buchkapitel
On Structural Signatures for Tree Data Structures
verfasst von : Kai Samelin, Henrich C. Pöhls, Arne Bilzhause, Joachim Posegga, Hermann de Meer
Erschienen in: Applied Cryptography and Network Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.