Abstract
Big graph model is frequently used to represent large-scale datasets such as geographical and healthcare data. Deploying these datasets in a third-party public cloud is a common solution for data sharing and processing. Maintaining data security in a public cloud is crucial. Here we target the data integrity issue, which is mainly achieved by hash operations. Existing hash schemes for graphs-structured data are either not suitable to all type of graphs or not computationally efficient for big graph. In this paper, we propose a secure, scalable hash scheme that is applicable to big graphs/trees, and its computation is highly efficient. We use the graph structure information to make our scheme unforgeable. Furthermore, we skillfully tune the scheme to make the graph verification and update processes very efficient. We will prove that our hash scheme is cryptographically secure. Our experimental results show that it has scalable computation performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Jagadish, H., & Olken, F. (2004). Database management for life sciences research. ACM SIGMOD Record, 33(2), 15–20.
Amazon, E. (2010). Amazon elastic compute cloud (Amazon EC2). Amazon Elastic Compute Cloud (Amazon EC2).
Low, Y., Gonzalez, J. E., Kyrola, A., Bickson, D., Guestrin, C. E., & Hellerstein, J. (2014). Graphlab: A new framework for parallel machine learning. arXiv preprint arXiv:1408.2041.
Arshad, M. U., Kundu, A., Bertino, E., Madhavan, K., & Ghafoor, A. (2014). Security of graph data: hashing schemes and definitions. In Proceedings of the 4th ACM Conference on Data and Application Security and Privacy (pp. 223–234). ACM.
Preneel, B. (1994). Cryptographic hash functions. European Transactions on Telecommunications, 5(4), 431–448.
Girault, M., Cohen, R., & Campana, M. (1988). A generalized birthday attack. In Workshop on the Theory and Application of Cryptographic Techniques (pp. 129–156). Springer.
Merkle, R. C. (1989). A certified digital signature. In Conference on the Theory and Application of Cryptology (pp. 218–238). Springer.
Martel, C., Nuckolls, G., Devanbu, P., Gertz, M., Kwong, A., & Stubblebine, S. G. (2004). A general model for authenticated data structures. Algorithmica, 39(1), 21–41.
Wei, W., Yu, T., & Xue, R. (2013). ibigtable: Practical data integrity for bigtable in public cloud. In Proceedings of the Third ACM Conference on Data and Application Security and Privacy (pp. 341–352). ACM.
Katz, J., & Lindell, Y. (2014). Introduction to modern cryptography. CRC press.
Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y. (2004). Order preserving encryption for numeric data. In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data (pp. 563–574). ACM.
Kundu, A., & Bertino, E. (2012). On hashing graphs. IACR Cryptology ePrint Archive, 2012, 352.
Leskovec, J., & Krevl, A. (2015). {SNAP Datasets}:{Stanford} large network dataset collection.
Leskovec, J., & Sosič, R. (2016). Snap: A general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technology (TIST), 8(1), 1.
Acknowledgements
The authors would like to thank the U.S. NSF (National Science Foundation) for their support through the project DUE-1315328. Any ideas presented here do not necessarily represent NSF’s opinions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Lu, Y., Hu, F., Li, X. (2018). Towards the Security of Big Data: Building a Scalable Hash Scheme for Big Graph. In: Latifi, S. (eds) Information Technology - New Generations. Advances in Intelligent Systems and Computing, vol 558. Springer, Cham. https://doi.org/10.1007/978-3-319-54978-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-54978-1_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-54977-4
Online ISBN: 978-3-319-54978-1
eBook Packages: EngineeringEngineering (R0)