Publication Type

Journal Article

Version

publishedVersion

Publication Date

4-2018

Abstract

We present a new type of public-key encryption called Criteria-based Encryption (or , for short). Different from Attribute-based Encryption, in , we consider the access policies as criteria carrying different weights. A user must hold some cases (or answers) satisfying the criteria and have sufficient weights in order to successfully decrypt a message. We then propose two Schemes under different settings: the first scheme requires a user to have at least one case for a criterion specified by the encryptor in the access structure, while the second scheme requires a user to have all the cases for each criterion. We prove that both schemes are secure under the Decisional q-Bilinear Diffie Hellman Exponent assumption without random oracles. In addition, we also present two special schemes for the above two settings without considering the weight requirement. We show that under this special case schemes can be constructed much more efficiently.

Keywords

criteria-based encryption, polynomial, root, ViSte's formula, weight

Discipline

Data Storage Systems | Information Security

Research Areas

Information Systems and Management

Publication

Computer Journal

Volume

61

Issue

4

First Page

512

Last Page

525

ISSN

0010-4620

Identifier

10.1093/comjnl/bxx088

Publisher

Oxford University Press (OUP): Policy B - Oxford Open Option B

Additional URL

http://doi.org/10.1093/comjnl/bxx088

Download

Share

COinS