Abstract
With the ever increasing growth of cloud computing and the resulting outsourcing of data, concerns of data integrity, security, and privacy are also on the rise. Among these, evidence of data integrity, i.e., being tamper-evident and current, seem to be of immediate concern. While several integrity techniques currently exist, most result in significant overhead at the database owner site. For clients with large databases, these are not viable solutions. In this paper, we propose a computationally efficient alternative—database integrity with Bloom filters. We focus both on the tamper-evidence and freshness properties of the database as well as completeness of query results. We propose two schemes for integrity enforcement—first using aggregates signatures and second using authenticated data structures. We provide detailed analysis and experimental results to prove their efficiency and correctness. The results are compared with the traditional security hash functions such as SHA-1 and are shown to be computationally efficient. We have also implemented the schemes on multiprocessor systems which show further reduction in the execution time. Our results clearly demonstrate the feasibility and efficacy of employing Bloom filters to enforce integrity for outsourced databases in cloud environments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tanebaum, A.S., Wetherall, D.J.: Computer Networks, 5th edn. Pearson Higher Education, London (2011)
Peng, J., Zhou, Y., Yang, Y.: Cyclic redundancy code checking based on small lookup table. In: IEEE Intl. Conf. on Communication Technology and Applications, pp. 596–599 (2010)
Gassend, B., Suh, G.E., Clarke, D., van Dijk, M., Devdas, S.: Caches and Merkle trees for efficient memory integrity verification. In: 9th Intl. Symp. High Performnace Computer Architecture (February 2003)
Silberschatz, A., Galvin, P.B., Gane, G.: Operating System Concepts, 8th edn. Wiley, Chichester (2009)
Gagliardi, R., Marcantoni, F., Polzonetti, A., Re, B., Tapanelli, P.: Cloud computing for network business ecosystem. In: IEEE Intl. Conf. Industrial Engineering and Engineering Managament (IEEM), pp. 862–868 (December 2010)
Gurman, J.B.: How many terabytes was that? Archiving and serving solar space data without losing your shirt. Bulletin of the American Astronomical Society 31, 955 (1999)
Devanbu, P., Gertz, M., Martel, C., Stubblebine, S.: Authentic data publication over the internet. Journal of Computer Security 11(3), 291–314 (2003)
Li, F., Hadjieleftheriou, M., Kollios, G., Reyzin, L.: Dynamic authenticated index structures for outsourced databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 121–132 (2006)
Yun, A., Shi, C., Kim, Y.: On protecting integrity and confidentiality of cryptographic file system for outsourced storage. In: CCSW 2009 (November 2009)
Goodrich, M.T., Papamanthou, C., Tamassia, R., Triandopoulos, N.: Athos: Efficient authentication of outsourced file systems. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp. 80–96. Springer, Heidelberg (2008)
Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. CACM 13(7), 422–426 (1970)
Chang, F., Dean, J., Ghemawat, S., Hseih, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.: Bigtable: A distributed data storage system for structured data. In: Proc. 7th Symp. Operating Systems Design and Implementation (OSDI 2006), pp. 205–218 (2006)
Kumar, A., Xu, J., Li, L., Wang, J.: Space-code Bloom filters for efficient traffic flow measurement. IEEE J. Selected Areas in Communication 24(12), 2327–2339 (2006)
Li, Z., Gong, G.: On data aggregation with secure Bloom filter in wireless sensor networks. Technical Report, Dept. of Electrical and Computer Engineering, Univ. Waterloo, Canada
Telidevara, A., Chandrasekaran, V., Srinivasan, A., Mukkamala, R., Gampa, S.: Similarity coefficient generators for network forensics. In: Proc. IEEE WIFS (2010)
Jian-ming, F., Ying, X., Hui-jun, X., Wei, W.: Strategy optimization for P2P security using Bloom filter. In: Intl. Conf. Multimedia Information Networking and Security, MINES 2009, pp. 403–406 (2009)
Quinn, M.J.: Parallel Programming in C with MP and OpenMP. McGraw-Hill, New York (2004)
Xie, M., Wang, H., Yin, J., Meng, X.: Integrity Auditing of Outsourced Data. In: VLDB (2007)
Mykletun, E., Narasimha, M., Tsudik, G.: Authentication and integrity in outsourced databases. In: NDSS. The Internet Society, San Diego (2004)
Li, F., Hadjieleftheriou, M., Kollios, G., Reyzin, L.: Dynamic authenticated index structures for outsourced databases. In: SIGMOD Conference, pp. 121–132. ACM, New York (2006)
Goodrich, M.T., Tamassia, R., Triandopoulos, N.: Super-efficient verification of dynamic outsourced databases. In: RSA Conference, CRYPTO Track (2008)
Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphism. In: Foundations of Secure Computation, pp. 169–170 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aditya, T., Baruah, P.K., Mukkamala, R. (2011). Employing Bloom Filters for Enforcing Integrity of Outsourced Databases in Cloud Environments. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22709-7_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-22709-7_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22708-0
Online ISBN: 978-3-642-22709-7
eBook Packages: Computer ScienceComputer Science (R0)