You are looking at a specific version 20140626:211821 of this paper. See the latest version.

Paper 2014/503

Efficient Hidden Vector Encryption with Constant-Size Ciphertext

Tran Viet Xuan Phuong and Guomin Yang and 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
Published elsewhere. Minor revision. ESORICS 2014
Keywords
{Hidden vector encryptionCiphertext policyConstant-size ciphertextViète's Formulas
Contact author(s)
tvxp750 @ uowmail edu au
History
2014-06-26: received
Short URL
https://ia.cr/2014/503
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.