Up until now, the best public key encryption with multi-dimensional range query (PKMDRQ) scheme has two problems which need to be resolved. One is that the scheme is selectively secure. The other is that the time of decryption is long. To address these problems, we present a method of converting a predicate encryption supporting inner product (IPE) scheme into a PKMDRQ scheme. By taking advantage of this approach, an instance is also proposed. The comparison between the previous work and ours shows that our scheme is more efficient over the time complexity. Moreover, our scheme is adaptively secure.
Yu ZHANG
Huazhong University of Science and Technology
Songfeng LU
Huazhong University of Science and Technology
Hua ZHAO
Huazhong University of Science and Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yu ZHANG, Songfeng LU, Hua ZHAO, "Approach for Constructing Public Key Encryption with Multi-Dimensional Range Query" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 2, pp. 754-757, February 2015, doi: 10.1587/transfun.E98.A.754.
Abstract: Up until now, the best public key encryption with multi-dimensional range query (PKMDRQ) scheme has two problems which need to be resolved. One is that the scheme is selectively secure. The other is that the time of decryption is long. To address these problems, we present a method of converting a predicate encryption supporting inner product (IPE) scheme into a PKMDRQ scheme. By taking advantage of this approach, an instance is also proposed. The comparison between the previous work and ours shows that our scheme is more efficient over the time complexity. Moreover, our scheme is adaptively secure.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.754/_p
Copy
@ARTICLE{e98-a_2_754,
author={Yu ZHANG, Songfeng LU, Hua ZHAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Approach for Constructing Public Key Encryption with Multi-Dimensional Range Query},
year={2015},
volume={E98-A},
number={2},
pages={754-757},
abstract={Up until now, the best public key encryption with multi-dimensional range query (PKMDRQ) scheme has two problems which need to be resolved. One is that the scheme is selectively secure. The other is that the time of decryption is long. To address these problems, we present a method of converting a predicate encryption supporting inner product (IPE) scheme into a PKMDRQ scheme. By taking advantage of this approach, an instance is also proposed. The comparison between the previous work and ours shows that our scheme is more efficient over the time complexity. Moreover, our scheme is adaptively secure.},
keywords={},
doi={10.1587/transfun.E98.A.754},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Approach for Constructing Public Key Encryption with Multi-Dimensional Range Query
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 754
EP - 757
AU - Yu ZHANG
AU - Songfeng LU
AU - Hua ZHAO
PY - 2015
DO - 10.1587/transfun.E98.A.754
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2015
AB - Up until now, the best public key encryption with multi-dimensional range query (PKMDRQ) scheme has two problems which need to be resolved. One is that the scheme is selectively secure. The other is that the time of decryption is long. To address these problems, we present a method of converting a predicate encryption supporting inner product (IPE) scheme into a PKMDRQ scheme. By taking advantage of this approach, an instance is also proposed. The comparison between the previous work and ours shows that our scheme is more efficient over the time complexity. Moreover, our scheme is adaptively secure.
ER -