Abstract
Information revelations from databases may result not only from intrusions by external attackers but also from malicious actions by employees and even database administrators. A promising new approach to solving this problem is the use of secret-shared databases. In this approach, information is divided into unreadable snippets, and the snippets are stored in separate subdatabases, thereby making it difficult for external and internal attackers to steal the original information. A secret-shared database is secure unless k or more database administrators collude, where k is a predefined threshold. Any query that is executable for a conventional database is executable for the corresponding secret-shared database. However, retrieval (i.e., selection) of a record from a secret-shared database has a time complexity of O(m), where m is the number of records stored in the database. We used a B+tree, which is a standard data structure for efficiently retrieving data from conventional databases, to develop a secret-shared B+tree that enables data retrieval from secret-shared databases with O(logm) time complexity while maintaining the security provided by secret sharing.
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
Anderson, R.J.: Security Engineering: A Guide to Building Dependable Distributed Systems. Wiley Publishing (2008)
Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A Framework for Fast Privacy-Preserving Computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192–206. Springer, Heidelberg (2008)
Burkhart, M., Strasser, M., Many, D., Demitropoulos, X.: SEPIA: Privacy preserving aggregation of multi-domain network events and statistics. In: 19th USENIX Security Symposium (2010)
Damgård, I.B., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285–304. Springer, Heidelberg (2006)
Date, C.J.: An Introduction to Database Systems. Addison Wesley Publishing (2003)
Hacigumus, H., Iver, B., Li, C., Mehrotra, S.: Executing SQL over Encrypted Data in the Database-Service-Provider Model. In: Proc. ACM SIGMOD, pp. 216–227 (2002)
Kiribuchi, N., Kato, R., Nishide, T., Yoshiura, H.: Batching Multiple Protocols to Improve Efficiency of Multi-Party Computation. In: Wu, C.-K., Yung, M., Lin, D. (eds.) Inscrypt 2011. LNCS, vol. 7537, pp. 289–308. Springer, Heidelberg (2012)
Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay: A Secure Two-Party Computation System. In: 13th USENIX Security Symposium (2004)
Ning, C., Xu, Q.: Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 483–500. Springer, Heidelberg (2010)
Nishide, T., Ohta, K.: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343–360. Springer, Heidelberg (2007)
Sakurai, Y., Saitou, T.: Using Secret Sharing for Construction of Distributed Database System Tolerant to Information Leakage and Data Destruction. In: The 29th Symposium on Cryptography and Information Security (2007)
Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)
Shimura, M., Miyazaki, K., Nishide, T., Yoshiura, H.: Relational Algebra in Multi-Party Protocol to Enable Structural Operation in Secret Shared Databases. Journal of Information Processing Society of Japan 51(9), 1563–1578 (2010) (in Japanese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nishiwaki, Y., Kato, R., Yoshiura, H. (2013). Securing a B+tree for Use with Secret-Shared Databases. In: Madaan, A., Kikuchi, S., Bhalla, S. (eds) Databases in Networked Information Systems. DNIS 2013. Lecture Notes in Computer Science, vol 7813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37134-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-37134-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37133-2
Online ISBN: 978-3-642-37134-9
eBook Packages: Computer ScienceComputer Science (R0)