Skip to main content
placeholder image

Efficient hidden vector encryption with constant-size ciphertext

Journal Article


Download full-text (Open Access)

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. © 2014 Springer International Publishing Switzerland.

Publication Date


  • 2014

Citation


  • Phuong, T. V. X., Yang, G. & Susilo, W. (2014). Efficient hidden vector encryption with constant-size ciphertext. Lecture Notes in Computer Science, 8712 472-487.

Scopus Eid


  • 2-s2.0-84906514653

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=4099&context=eispapers

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/3083

Has Global Citation Frequency


Number Of Pages


  • 15

Start Page


  • 472

End Page


  • 487

Volume


  • 8712

Place Of Publication


  • Germany

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. © 2014 Springer International Publishing Switzerland.

Publication Date


  • 2014

Citation


  • Phuong, T. V. X., Yang, G. & Susilo, W. (2014). Efficient hidden vector encryption with constant-size ciphertext. Lecture Notes in Computer Science, 8712 472-487.

Scopus Eid


  • 2-s2.0-84906514653

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=4099&context=eispapers

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/3083

Has Global Citation Frequency


Number Of Pages


  • 15

Start Page


  • 472

End Page


  • 487

Volume


  • 8712

Place Of Publication


  • Germany