The search functionality is under construction.

The search functionality is under construction.

The Hidden Vector Encryption scheme is one of the searchable public key encryption schemes that allow for searching encrypted data. The Hidden Vector Encryption scheme supports conjunctive equality, comparison, and subset queries, as well as arbitrary conjunctive combinations of these queries. In a Hidden Vector Encryption scheme, a receiver generates a token for a vector of searchable components and sends the token to a query server which has the capability to evaluate it on encrypted data. All of the existing Hidden Vector Encryption schemes, which are all pairing-based, require token elements and pairing computations proportional to the number of searchable components in the token. In this paper, we suggest an improved paring-based Hidden Vector Encryption scheme where the token elements and pairing computations are independent of the number of searchable components. Namely, for an arbitrary conjunctive search query, the token is of size *O*(1) and the query server only needs *O*(1) pairing computations. The latter improvement in particular might be very attractive to a query server in a larger search system with many users. To achieve our goal, we introduce a novel technique to generate a token, which may be of independent interest.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.9 pp.1620-1631

- Publication Date
- 2010/09/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E93.A.1620

- Type of Manuscript
- PAPER

- Category
- Cryptography and Information Security

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Jong Hwan PARK, Dong Hoon LEE, "A Hidden Vector Encryption Scheme with Constant-Size Tokens and Pairing Computations" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 9, pp. 1620-1631, September 2010, doi: 10.1587/transfun.E93.A.1620.

Abstract: The Hidden Vector Encryption scheme is one of the searchable public key encryption schemes that allow for searching encrypted data. The Hidden Vector Encryption scheme supports conjunctive equality, comparison, and subset queries, as well as arbitrary conjunctive combinations of these queries. In a Hidden Vector Encryption scheme, a receiver generates a token for a vector of searchable components and sends the token to a query server which has the capability to evaluate it on encrypted data. All of the existing Hidden Vector Encryption schemes, which are all pairing-based, require token elements and pairing computations proportional to the number of searchable components in the token. In this paper, we suggest an improved paring-based Hidden Vector Encryption scheme where the token elements and pairing computations are independent of the number of searchable components. Namely, for an arbitrary conjunctive search query, the token is of size *O*(1) and the query server only needs *O*(1) pairing computations. The latter improvement in particular might be very attractive to a query server in a larger search system with many users. To achieve our goal, we introduce a novel technique to generate a token, which may be of independent interest.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1620/_p

Copy

@ARTICLE{e93-a_9_1620,

author={Jong Hwan PARK, Dong Hoon LEE, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={A Hidden Vector Encryption Scheme with Constant-Size Tokens and Pairing Computations},

year={2010},

volume={E93-A},

number={9},

pages={1620-1631},

abstract={The Hidden Vector Encryption scheme is one of the searchable public key encryption schemes that allow for searching encrypted data. The Hidden Vector Encryption scheme supports conjunctive equality, comparison, and subset queries, as well as arbitrary conjunctive combinations of these queries. In a Hidden Vector Encryption scheme, a receiver generates a token for a vector of searchable components and sends the token to a query server which has the capability to evaluate it on encrypted data. All of the existing Hidden Vector Encryption schemes, which are all pairing-based, require token elements and pairing computations proportional to the number of searchable components in the token. In this paper, we suggest an improved paring-based Hidden Vector Encryption scheme where the token elements and pairing computations are independent of the number of searchable components. Namely, for an arbitrary conjunctive search query, the token is of size *O*(1) and the query server only needs *O*(1) pairing computations. The latter improvement in particular might be very attractive to a query server in a larger search system with many users. To achieve our goal, we introduce a novel technique to generate a token, which may be of independent interest.},

keywords={},

doi={10.1587/transfun.E93.A.1620},

ISSN={1745-1337},

month={September},}

Copy

TY - JOUR

TI - A Hidden Vector Encryption Scheme with Constant-Size Tokens and Pairing Computations

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1620

EP - 1631

AU - Jong Hwan PARK

AU - Dong Hoon LEE

PY - 2010

DO - 10.1587/transfun.E93.A.1620

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E93-A

IS - 9

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - September 2010

AB - The Hidden Vector Encryption scheme is one of the searchable public key encryption schemes that allow for searching encrypted data. The Hidden Vector Encryption scheme supports conjunctive equality, comparison, and subset queries, as well as arbitrary conjunctive combinations of these queries. In a Hidden Vector Encryption scheme, a receiver generates a token for a vector of searchable components and sends the token to a query server which has the capability to evaluate it on encrypted data. All of the existing Hidden Vector Encryption schemes, which are all pairing-based, require token elements and pairing computations proportional to the number of searchable components in the token. In this paper, we suggest an improved paring-based Hidden Vector Encryption scheme where the token elements and pairing computations are independent of the number of searchable components. Namely, for an arbitrary conjunctive search query, the token is of size *O*(1) and the query server only needs *O*(1) pairing computations. The latter improvement in particular might be very attractive to a query server in a larger search system with many users. To achieve our goal, we introduce a novel technique to generate a token, which may be of independent interest.

ER -