Abstract
In this paper, we first point out a weakness in range queries, which we have named the index ordering problem, where an adversary can recover actual randomized bucket indexes. At first, we define the index ordering problem and examine the security of existing bucket-based encrypted DB management techniques for range queries. We also provide simple countermeasures that enhance the security of bucketing techniques against the bucket index ordering problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Agrawal R, Kiernan J, Srikant R et al (2004) Order preserving encryption for numeric data. In: Proceedings of SIGMOD’04, pp 563–574
Ceselli A, Damiani E, Vimercati S et al (2005) Modeling and assessing inference exposure in encrypted databases. ACM Trans Inf Syst Secur 8(1):119–152
Damiani E, Vimercati S, Jajodia S et al (2003) Balancing confidentiality and efficiency in untrusted relational DBMSs. In: Proceedings of CCS’03, pp 93–102
Hacigumus H, Iyer B, Li C et al (2002) Executing SQL over encrypted data in the database-service-provider model. In: Proceedings of ACM SIGMOD’02, pp 216–227
Hore B, Mehrotra S, Tsudik G (2004) A privacy-preserving index for range queries. In: Proceedings of VLDB’04, pp 720–731
Jang SM, Song SI, Yoo JS (2007) An efficient PAB-based query indexing for processing continuous queries on moving objects. ETRI J 29(05):691–693
Wang J, Du X (2008) LOB: bucket based index for range queries. In: Proceedings of WAIM’08, pp 86–92
Acknowledgments
This research was supported by Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (Grant No. 2011-0029925). This research was supported by Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (Grant No. 2011-0029926).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Youn, TY., Jho, NS., Chang, KY., Hong, D. (2014). Bucket Index Ordering Problem in Range Queries. In: Park, J., Zomaya, A., Jeong, HY., Obaidat, M. (eds) Frontier and Innovation in Future Computing and Communications. Lecture Notes in Electrical Engineering, vol 301. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-8798-7_42
Download citation
DOI: https://doi.org/10.1007/978-94-017-8798-7_42
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-017-8797-0
Online ISBN: 978-94-017-8798-7
eBook Packages: EngineeringEngineering (R0)