Transforming Hidden Vector Encryption Schemes from Composite to Prime Order Groups

TL;DR

This paper introduces a conversion method that transforms hidden vector encryption schemes from composite order to prime order bilinear groups, enhancing efficiency and security assumptions in predicate encryption.

Contribution

It presents a novel conversion technique for HVE schemes from composite to prime order groups, supporting various prime groups and simplifying security assumptions.

Findings

Constructed efficient HVE schemes in prime order groups

Proved selective security under simple assumptions

Provided a general conversion method for HVE schemes

Abstract

Predicate encryption is a new type of public key encryption that enables searches on encrypted data. By using predicate encryption, we can search keywords or attributes on encrypted data without decrypting ciphertexts. Hidden vector encryption (HVE) is a special kind of predicate encryption. HVE supports the evaluation of conjunctive equality, comparison, and subset operations between attributes in ciphertexts and attributes in tokens. In this paper, we construct efficient HVE schemes in prime order bilinear groups derived from previous HVE schemes in composite order bilinear groups, and prove their selective security under simple assumptions. To achieve this result, we present a conversion method that transforms HVE schemes from composite order bilinear groups into prime order bilinear groups. Our method supports any types of prime order bilinear groups and uses simple assumptions.