TY - JOUR
T1 - Multi-Client Order-Revealing Encryption
AU - Eom, Jieun
AU - Lee, Dong Hoon
AU - Lee, Kwangsu
N1 - Funding Information:
This work was supported by the Institute for Information & communications Technology Promotion (IITP) through the Korea Government (MSIT) under Grant 2016-6-00600–A Study on Functional Encryption: Construction, Security Analysis, and Implementation.
PY - 2018/8/11
Y1 - 2018/8/11
N2 - Order-revealing encryption is a useful cryptographic primitive that provides range queries on encrypted data since anyone can compare the order of plaintexts by running a public comparison algorithm. Most studies on order-revealing encryption focus only on comparing ciphertexts generated by a single client, and there is no study on comparing ciphertexts generated by multiple clients. In this paper, we propose the concept of multi-client order-revealing encryption that supports comparisons not only on ciphertexts generated by one client but also on ciphertexts generated by multiple clients. We also define a simulation-based security model for the multi-client order-revealing encryption. The security model is defined with respect to the leakage function which quantifies how much information is leaked from the scheme. Next, we present two specific multi-client order-revealing encryption schemes with different leakage functions in bilinear maps and prove their security in the random oracle model. Finally, we give the implementation of the proposed schemes and suggest methods to improve the performance of ciphertext comparisons.
AB - Order-revealing encryption is a useful cryptographic primitive that provides range queries on encrypted data since anyone can compare the order of plaintexts by running a public comparison algorithm. Most studies on order-revealing encryption focus only on comparing ciphertexts generated by a single client, and there is no study on comparing ciphertexts generated by multiple clients. In this paper, we propose the concept of multi-client order-revealing encryption that supports comparisons not only on ciphertexts generated by one client but also on ciphertexts generated by multiple clients. We also define a simulation-based security model for the multi-client order-revealing encryption. The security model is defined with respect to the leakage function which quantifies how much information is leaked from the scheme. Next, we present two specific multi-client order-revealing encryption schemes with different leakage functions in bilinear maps and prove their security in the random oracle model. Finally, we give the implementation of the proposed schemes and suggest methods to improve the performance of ciphertext comparisons.
KW - Bilinear maps
KW - multi-client order-revealing encryption
KW - order-revealing encryption
KW - symmetric-key encryption
UR - http://www.scopus.com/inward/record.url?scp=85051675735&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85051675735&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2018.2864991
DO - 10.1109/ACCESS.2018.2864991
M3 - Article
AN - SCOPUS:85051675735
VL - 6
SP - 45458
EP - 45472
JO - IEEE Access
JF - IEEE Access
SN - 2169-3536
M1 - 8434214
ER -