Anonymous Multi-Attribute Encryption with Range Query and Conditional Decryption∗
John Bethencourt, Hubert Chan, Adrian Perrig, Elaine Shi, Dawn Song · 2006
No. 0448452. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. Keywords: Range query, conditional decryption, anonymous identity-based encryption, multidimensional We introduce the concept of Anonymous Multi-Attribute Encryption with Range Query and Conditional Decryption (AMERQCD). In AMERQCD, a plaintext is encrypted under a point in multidimensional space. To a computationally bounded adversary, the ciphertext hides both the plaintext and the point under which it is encrypted. In a range query, a master key owner releases the decryption key for an arbitrary hyper-rectangle in space, thus allowing decryption of ciphertexts previously encrypted under any point within the hyper-rectangle. However, a computationally bounded adversary cannot learn any information on ciphertexts outside the range covered by the decryption key (except the fact that they do not lie within this range). We give an efficient construction based Searching on encrypted data is an important technique to provide both functionality and privacy in database applications, and has recently captured a considerable amount of attention in the community.