A Hidden Vector Encryption scheme with constant-size tokens and pairing computations

Jong Hwan Park, Dong Hoon Lee

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 0(1) and the query server only needs 0(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.

Original languageEnglish
Pages (from-to)1620-1631
Number of pages12
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE93-A
Issue number9
DOIs
Publication statusPublished - 2010 Sep 1

Fingerprint

Pairing
Encryption
Cryptography
Query
Servers
Server
Number of Components
Public Key Encryption
Arbitrary
Equality
Receiver
Directly proportional
Subset
Evaluate

Keywords

  • Bilinear maps
  • Hidden vector encryption
  • Searchable public key encryption

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

@article{900a2d7966c246a8aed5690084965c03,
title = "A Hidden Vector Encryption scheme with constant-size tokens and pairing computations",
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 0(1) and the query server only needs 0(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 = "Bilinear maps, Hidden vector encryption, Searchable public key encryption",
author = "Park, {Jong Hwan} and Lee, {Dong Hoon}",
year = "2010",
month = "9",
day = "1",
doi = "10.1587/transfun.E93.A.1620",
language = "English",
volume = "E93-A",
pages = "1620--1631",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

TY - JOUR

T1 - A Hidden Vector Encryption scheme with constant-size tokens and pairing computations

AU - Park, Jong Hwan

AU - Lee, Dong Hoon

PY - 2010/9/1

Y1 - 2010/9/1

N2 - 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 0(1) and the query server only needs 0(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.

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 0(1) and the query server only needs 0(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.

KW - Bilinear maps

KW - Hidden vector encryption

KW - Searchable public key encryption

UR - http://www.scopus.com/inward/record.url?scp=77956490316&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956490316&partnerID=8YFLogxK

U2 - 10.1587/transfun.E93.A.1620

DO - 10.1587/transfun.E93.A.1620

M3 - Article

VL - E93-A

SP - 1620

EP - 1631

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 9

ER -