Efficient hidden vector encryption with constant-size ciphertext

• Main Authors: PHUONG, Tran Viet Xuan, YANG, Guomin, SUSILO, Willy
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2014
• Subjects: ciphertext policy; constant-size ciphertext; hidden vector encryption; Viète's Formulas; Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/7375; https://ink.library.smu.edu.sg/context/sis_research/article/8378/viewcontent/Efficient_hidden_vector_encryption_with_constant_size_ciphertext.pdf
• Institution: Singapore Management University

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.