Skip to main content
placeholder image

Efficient hidden vector encryption with constant-size ciphertext

Conference Paper


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.

UOW Authors


  •   Phuong, Tran Viet Xuan. (external author)
  •   Yang, Guomin (external author)
  •   Susilo, Willy

Publication Date


  • 2014

Citation


  • Phuong, T. V. X., Yang, G. & Susilo, W. (2014). Efficient hidden vector encryption with constant-size ciphertext. In M. Kutylowski & J. Vaidya (Eds.), Computer Security - ESORICS 2014 19th European Symposium on Research in Computer Security Wrocław, Poland, September 7-11, 2014 Proceedings, Part I (pp. 472-487). Germany: Springer.

Scopus Eid


  • 2-s2.0-84906514653

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/1269

Start Page


  • 472

End Page


  • 487

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.

UOW Authors


  •   Phuong, Tran Viet Xuan. (external author)
  •   Yang, Guomin (external author)
  •   Susilo, Willy

Publication Date


  • 2014

Citation


  • Phuong, T. V. X., Yang, G. & Susilo, W. (2014). Efficient hidden vector encryption with constant-size ciphertext. In M. Kutylowski & J. Vaidya (Eds.), Computer Security - ESORICS 2014 19th European Symposium on Research in Computer Security Wrocław, Poland, September 7-11, 2014 Proceedings, Part I (pp. 472-487). Germany: Springer.

Scopus Eid


  • 2-s2.0-84906514653

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/1269

Start Page


  • 472

End Page


  • 487

Place Of Publication


  • Germany