Delegatable Order-Revealing Encryption for Reliable Cross-Database Query

Citations

WEB OF SCIENCE

6
Citations

SCOPUS

4

초록

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.

키워드

Databases; Authorization; Forgery; Encryption; Servers; Public key; Encapsulation; Range query; order-revealing encryption; encrypted database; cross-database query; delegation; PAIRINGS
제목
Delegatable Order-Revealing Encryption for Reliable Cross-Database Query
저자
Hahn, Changhee; Hur, Junbeom
DOI
10.1109/TSC.2022.3192551
발행일
2023-05
유형
Article
저널명
IEEE Transactions on Services Computing
권
16
호
3
페이지
1763 ~ 1777