TY - JOUR
T1 - Delegatable Order-Revealing Encryption for Reliable Cross-Database Query
AU - Hahn, Changhee
AU - Hur, Junbeom
N1 - Publisher Copyright:
© 2008-2012 IEEE.
PY - 2023/5/1
Y1 - 2023/5/1
N2 - Cloud service providers adopt pay-per-query pricing models to charge data owners based on the amount of data scanned by each query. In such models, the trustworthiness of the underlying billing system is as important as the privacy preservation for the data and queries. In this paper, we revisit delegatable order-revealing encryption (DORE), a range query algorithm allowing authorized users to retrieve data of specific ranges across multiple databases encrypted under different secret keys. We first investigate which factor in the authorization mechanism of DORE can lead to overprivileged users and let them allow any unauthorized user to query over the database of the victim without risking their credits, such as leaking the secret keys. Unfortunately, such unauthorized queries would incur unexpected financial damage to the victim in practical pay-per-query models. We then propose SEDORE, a secure order-revealing encryption scheme with resilience to unauthorized queries across databases. SEDORE features a novel user authorization mechanism limiting user privileges carefully. Consequently, the authorized users cannot illegally invite any unauthorized user to query unless they entirely leak their credits. We demonstrate that the performance of SEDORE is comparable to that of DORE while achieving a higher security level.
AB - Cloud service providers adopt pay-per-query pricing models to charge data owners based on the amount of data scanned by each query. In such models, the trustworthiness of the underlying billing system is as important as the privacy preservation for the data and queries. In this paper, we revisit delegatable order-revealing encryption (DORE), a range query algorithm allowing authorized users to retrieve data of specific ranges across multiple databases encrypted under different secret keys. We first investigate which factor in the authorization mechanism of DORE can lead to overprivileged users and let them allow any unauthorized user to query over the database of the victim without risking their credits, such as leaking the secret keys. Unfortunately, such unauthorized queries would incur unexpected financial damage to the victim in practical pay-per-query models. We then propose SEDORE, a secure order-revealing encryption scheme with resilience to unauthorized queries across databases. SEDORE features a novel user authorization mechanism limiting user privileges carefully. Consequently, the authorized users cannot illegally invite any unauthorized user to query unless they entirely leak their credits. We demonstrate that the performance of SEDORE is comparable to that of DORE while achieving a higher security level.
KW - Range query
KW - cross-database query
KW - delegation
KW - encrypted database
KW - order-revealing encryption
UR - http://www.scopus.com/inward/record.url?scp=85135212347&partnerID=8YFLogxK
U2 - 10.1109/TSC.2022.3192551
DO - 10.1109/TSC.2022.3192551
M3 - Article
AN - SCOPUS:85135212347
SN - 1939-1374
VL - 16
SP - 1763
EP - 1777
JO - IEEE Transactions on Services Computing
JF - IEEE Transactions on Services Computing
IS - 3
ER -