ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Conference Paper Bucket Index Ordering Problem in Range Queries
Cited 0 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Taek-Young Youn, Nam-Su Jho, Ku-Young Chang, Dowon Hong
Issue Date
2014-01
Citation
International Symposium on Frontier and Innovation in Future Computing and Communications (FCC) 2014 (LNEE 301), pp.347-355
Publisher
Springer
Language
English
Type
Conference Paper
DOI
https://dx.doi.org/10.1007/978-94-017-8798-7_42
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.
KSP Keywords
Management techniques, range queries