Approach for Constructing Public Key Encryption with Multi-Dimensional Range Query

Yu ZHANG  Songfeng LU  Hua ZHAO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E98-A   No.2   pp.754-757
Publication Date: 2015/02/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E98.A.754
Type of Manuscript: LETTER
Category: Cryptography and Information Security
public key encryption,  multi-dimensional range query,  searching on encrypted data,  

Full Text: PDF(90KB)>>
Buy this Article

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.