Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

9-2014

Abstract

A Hidden Vector Encryption (HVE) scheme is a special type of anonymous identity-based encryption (IBE) scheme where the attribute string associated with the ciphertext or the user secret key can contain wildcards. In this paper, we introduce two constant-size ciphertext-policy hidden vector encryption (CP-HVE) schemes. Our first scheme is constructed on composite order bilinear groups, while the second one is built on prime order bilinear groups. Both schemes are proven secure in a selective security model which captures plaintext (or payload) and attribute hiding. To the best of our knowledge, our schemes are the first HVE constructions that can achieve constant-size ciphertext among all the existing HVE schemes.

Keywords

ciphertext policy, constant-size ciphertext, hidden vector encryption, Viète's Formulas

Discipline

Information Security

Research Areas

Information Systems and Management

Publication

Proceedings of the 19th European Symposium on Research in Computer Security, Wroclaw, Poland, 2014 September 7-11

First Page

472

Last Page

487

ISBN

9783319112022

Identifier

10.1007/978-3-319-11203-9_27

Publisher

Springer Verlag

City or Country

Wrocław, Poland

Additional URL

http://doi.org/10.1007/978-3-319-11203-9_27

Download

Share

COinS