Transforming Hidden Vector Encryption Schemes from Composite to Prime Order Groups

详细信息    查看全文

• 关键词：Searchable encryption ; Predicate encryption ; Hidden vector encryption ; Conversion method ; Bilinear maps
• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10157
• 期：1
• 页码：101-125
• 丛书名：Information Security and Cryptology ?ICISC 2016
• ISBN：978-3-319-53177-9
• 卷排序：10157

文摘

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.