Ciphertext policy multi-dimensional range encryption

4Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There are many applications in which services are provided only if some values associated with some confidential (encrypted) data are within a specific range. In this paper, we propose the notion of (ciphertext-policy) range encryption (RE) that can be used in many of such applications. RE is a type of public key encryption with additional functionality where an encryptor can freely specify a range to a ciphertext so that it can be decrypted only if the values associated with the key belong to the range. We propose a concrete RE scheme based on the time-specific encryption scheme by Kasamatsu et al. (SCN2012). Our RE scheme is selectively secure under the weak bilinear Diffie-Hellman inversion assumption. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Kasamatsu, K., Matsuda, T., Hanaoka, G., & Imai, H. (2013). Ciphertext policy multi-dimensional range encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7839 LNCS, pp. 247–261). https://doi.org/10.1007/978-3-642-37682-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free