A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Content extraction signatures using XML digital signatures and custom transforms on-demand
WWW '03 Proceedings of the 12th international conference on World Wide Web
Digitally signed document sanitizing scheme based on bilinear maps
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Authentication and integrity in outsourced databases
ACM Transactions on Storage (TOS)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
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
How to authenticate graphs without leaking
Proceedings of the 13th International Conference on Extending Database Technology
Knowledge-binding commitments with applications in time-stamping
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Redactable signatures for tree-structured data: definitions and constructions
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
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
On structural signatures for tree data structures
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Security of graph data: hashing schemes and definitions
Proceedings of the 4th ACM conference on Data and application security and privacy
Hi-index | 0.00 |
Redactable signatures for linear-structured data such as strings have already been studied in the literature. In this paper, we propose a formal security model for leakage-free redactable signatures (LFRS) that is general enough to address authentication of not only trees but also graphs and forests. LFRS schemes have several applications, especially in enabling secure data management in the emerging cloud computing paradigm as well as in healthcare, finance and biological applications. We have also formally defined the notion of secure names. Such secure names facilitate leakage-free verification of ordering between siblings/nodes. The paper also proposes a construction for secure names, and a construction for leakagefree redactable signatures based on the secure naming scheme. The proposed construction computes a linear number of signatures with respect to the size of the data object, and outputs only one signature that is stored, transmitted and used for authentication of any tree, graph and forest.