Security and inference in multilevel database and knowledge-base systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
CRYPTO '89 Proceedings on Advances in cryptology
An optimal algorithm for reconstructing a binary tree
Information Processing Letters
The BiBa one-time signature and broadcast authentication protocol
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Flexible authentication of XML documents
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Efficient Parallel Algorithms for Tree-Related Problems Using the Parentheses Matching Strategy
Proceedings of the 8th International Symposium on Parallel Processing
On Certificate Revocation and Validation
FC '98 Proceedings of the Second International Conference on Financial Cryptography
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
Derived access control specification for XML
Proceedings of the 2003 ACM workshop on XML security
A General Model for Authenticated Data Structures
Algorithmica
Order preserving encryption for numeric data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Selective and Authentic Third-Party Distribution of XML Documents
IEEE Transactions on Knowledge and Data Engineering
Correcting errors without leaking partial information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Distributed privacy preserving information sharing
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Preventing attribute information leakage in automated trust negotiation
Proceedings of the 12th ACM conference on Computer and communications security
Journal of Cognitive Neuroscience
Secure Dissemination of XML Content Using Structure-based Routing
EDOC '06 Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference
The boundary between privacy and utility in data publishing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Minimality attack in privacy preserving data publishing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Knowledge-binding commitments with applications in time-stamping
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Detecting information leakage in updating XML documents of fine-grained access control
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Authenticated join processing in outsourced databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
How to authenticate graphs without leaking
Proceedings of the 13th International Conference on Extending Database Technology
Continuous authentication on relational streams
The VLDB Journal — The International Journal on Very Large Data Bases
Authenticated Index Structures for Aggregation Queries
ACM Transactions on Information and System Security (TISSEC)
Redactable signatures for tree-structured data: definitions and constructions
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Secure authenticated comparisons
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Leakage-free redactable signatures
Proceedings of the second ACM conference on Data and Application Security and Privacy
Redactable signatures for independent removal of structure and content
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
On structural signatures for tree data structures
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Authentication of moving range queries
Proceedings of the 21st ACM international conference on Information and knowledge management
Efficient tree pattern queries on encrypted XML documents
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Access control and query verification for untrusted databases
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
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 |
Data sharing with multiple parties over a third-party distribution framework requires that both data integrity and confidentiality be assured. One of the most widely used data organization structures is the tree structure. When such structures encode sensitive information (such as in XML documents), it is crucial that integrity and confidentiality be assured not only for the content, but also for the structure. Digital signature schemes are commonly used to authenticate the integrity of the data. The most widely used such technique for tree structures is the Merkle hash technique, which however is known to be "not hiding", thus leading to unauthorized leakage of information. Most techniques in the literature are based on the Merkle hash technique and thus suffer from the problem of unauthorized information leakages. Assurance of integrity and confidentiality (no leakages) of tree-structured data is an important problem in the context of secure data publishing and content distribution systems. In this paper, we propose a signature scheme for tree structures, which assures both confidentiality and integrity and is also efficient, especially in third-party distribution environments. Our integrity assurance technique, which we refer to as the "Structural signature scheme", is based on the structure of the tree as defined by tree traversals (pre-order, post-order, in-order) and is defined using a randomized notion of such traversal numbers. In addition to formally defining the technique, we prove that it protects against violations of content and structural integrity and information leakages. We also show through complexity and performance analysis that the structural signature scheme is efficient; with respect to the Merkle hash technique, it incurs comparable cost for signing the trees and incurs lower cost for user-side integrity verification.