Efficient Hidden Vector Encryption with Constant-Size Ciphertext

Tran Viet Xuan Phuong; Guomin Yang; Willy Susilo

Paper 2014/503 Original: eprint.iacr.org/2014/503 ↗

Efficient Hidden Vector Encryption with Constant-Size Ciphertext

Tran Viet Xuan Phuong

Guomin Yang

Willy Susilo

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2014-06-26: last updated; 2014-06-26: published
Short URL: https://ia.cr/2014/503
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2014/503,
      author = {Tran Viet Xuan Phuong and Guomin Yang and Willy Susilo},
      title = {Efficient Hidden Vector Encryption with Constant-Size Ciphertext},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/503},
      year = {2014},
      url = {https://eprint.iacr.org/2014/503}
}