An optimal algorithm for reconstructing a binary tree
Information Processing Letters
Perfectly one-way probabilistic hash functions (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Introduction to algorithms
Efficient Parallel Algorithms for Tree-Related Problems Using the Parentheses Matching Strategy
Proceedings of the 8th International Symposium on Parallel Processing
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A General Model for Authenticated Data Structures
Algorithmica
Database management for life sciences research
ACM SIGMOD Record
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Structural signatures for tree data structures
Proceedings of the VLDB Endowment
Order-Preserving Symmetric Encryption
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Graph clustering based on structural/attribute similarities
Proceedings of the VLDB Endowment
Authentication of moving kNN queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Leakage-free redactable signatures
Proceedings of the second ACM conference on Data and Application Security and Privacy
An Ideal-Security Protocol for Order-Preserving Encoding
SP '13 Proceedings of the 2013 IEEE Symposium on Security and Privacy
| Hi-index | 0.00 |
Use of graph-structured data models is on the rise - in graph databases, in representing biological and healthcare data as well as geographical data. In order to secure graph-structured data, and develop cryptographically secure schemes for graph databases, it is essential to formally define and develop suitable collision resistant one-way hashing schemes and show them they are efficient. The widely used Merkle hash technique is not suitable as it is, because graphs may be directed acyclic ones or cyclic ones. In this paper, we are addressing this problem. Our contributions are: (1) define the practical and formal security model of hashing schemes for graphs, (2) define the formal security model of perfectly secure hashing schemes, (3) describe constructions of hashing and perfectly secure hashing of graphs, and (4) performance results for the constructions. Our constructions use graph traversal techniques, and are highly efficient for hashing, redaction, and verification of hashes graphs. We have implemented the proposed schemes, and our performance analysis on both real and synthetic graph data sets support our claims.