Redactable signatures for independent removal of structure and content

Authors:
Kai Samelin;Henrich C. Pöhls;Arne Bilzhause;Joachim Posegga;Hermann de Meer
Affiliations:
Institute of IT-Security and Security-Law (ISL), University of Passau, Germany;Institute of IT-Security and Security-Law (ISL), University of Passau, Germany;Institute of IT-Security and Security-Law (ISL), University of Passau, Germany;Institute of IT-Security and Security-Law (ISL), University of Passau, Germany;Institute of IT-Security and Security-Law (ISL), University of Passau, Germany
Venue:
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Year:
2012

Citing 20
Cited 2

One-way accumulators: a decentralized alternative to digital signatures

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Lattice-Based Access Control Models

Computer
Homomorphic Signature Schemes

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Content Extraction Signatures

ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
An Identity Based Encryption system

Proceedings of the 3rd international symposium on Principles and practice of programming in Java
Digitally signed document sanitizing scheme based on bilinear maps

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Efficient signature schemes supporting redaction, pseudonymization, and data deidentification

Proceedings of the 2008 ACM symposium on Information, computer and communications security
Structural signatures for tree data structures

Proceedings of the VLDB Endowment
Sanitizable and Deletable Signature

Information Security Applications
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
How to authenticate graphs without leaking

Proceedings of the 13th International Conference on Extending Database Technology
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Redactable signatures for tree-structured data: definitions and constructions

ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Sanitizable signatures in XML signature: performance, mixing properties, and revisiting the property of transparency

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Sanitizable signatures

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Unlinkability of sanitizable signatures

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Extended sanitizable signatures

ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
On extended sanitizable signature schemes

CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Redactable Signatures for Signed CDA Documents

Journal of Medical Systems

On structural signatures for tree data structures

ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Document sanitization: measuring search engine information loss and risk of disclosure for the wikileaks cables

PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a provably secure redactable signature scheme allowing to independently redact structure and content. We identify the problems when structure is not separated from content, resulting in an attack on the scheme proposed at VLDB '08 by Kundu and Bertino. The attack allows for changing the semantic meaning of a given tree. We introduce a rigid security model, including consecutive redaction control, to formalize the required behaviour of our scheme. Moreover, we present first performance evaluations of our implementation to demonstrate the practical use of the presented scheme.