Fully secure hidden vector encryption under standard assumptions

Jong Hwan Park, Kwangsu Lee, Willy Susilo, Dong Hoon Lee

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Hidden Vector Encryption (HVE) is a special type of predicate encryption that can support conjunctive equality and range searches on encrypted data. All previous HVE schemes were proven to be either selectively secure or weakly attribute-hiding. In this paper, we first construct a new HVE scheme that is fully secure under standard assumptions. Our HVE scheme, which is based on bilinear maps (pairings), provides efficiency advantages in that it requires O(1)-sized private keys and O(1) pairing computations for decryption, regardless of both the number of conjunctives and the dimension of vectors. To achieve our goal, we develop a novel technique to realize a tag-based dual system encryption in prime-order groups and show how to hide vector components and compress tag values into one.

Original languageEnglish
Pages (from-to)188-207
Number of pages20
JournalInformation Sciences
Volume232
DOIs
Publication statusPublished - 2013 Feb 8

Fingerprint

Encryption
Cryptography
Pairing
Bilinear Map
Predicate
Standards
Equality
Attribute
Range of data
Tag

Keywords

  • Dual system encryption
  • Hidden vector encryption
  • Predicate encryption
  • Search on encrypted data

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management

Cite this

Fully secure hidden vector encryption under standard assumptions. / Park, Jong Hwan; Lee, Kwangsu; Susilo, Willy; Lee, Dong Hoon.

In: Information Sciences, Vol. 232, 08.02.2013, p. 188-207.

Research output: Contribution to journalArticle

Park, Jong Hwan ; Lee, Kwangsu ; Susilo, Willy ; Lee, Dong Hoon. / Fully secure hidden vector encryption under standard assumptions. In: Information Sciences. 2013 ; Vol. 232. pp. 188-207.
@article{d06a704a56af47ab92ef3a567f3f2c11,
title = "Fully secure hidden vector encryption under standard assumptions",
abstract = "Hidden Vector Encryption (HVE) is a special type of predicate encryption that can support conjunctive equality and range searches on encrypted data. All previous HVE schemes were proven to be either selectively secure or weakly attribute-hiding. In this paper, we first construct a new HVE scheme that is fully secure under standard assumptions. Our HVE scheme, which is based on bilinear maps (pairings), provides efficiency advantages in that it requires O(1)-sized private keys and O(1) pairing computations for decryption, regardless of both the number of conjunctives and the dimension of vectors. To achieve our goal, we develop a novel technique to realize a tag-based dual system encryption in prime-order groups and show how to hide vector components and compress tag values into one.",
keywords = "Dual system encryption, Hidden vector encryption, Predicate encryption, Search on encrypted data",
author = "Park, {Jong Hwan} and Kwangsu Lee and Willy Susilo and Lee, {Dong Hoon}",
year = "2013",
month = "2",
day = "8",
doi = "10.1016/j.ins.2012.12.034",
language = "English",
volume = "232",
pages = "188--207",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Fully secure hidden vector encryption under standard assumptions

AU - Park, Jong Hwan

AU - Lee, Kwangsu

AU - Susilo, Willy

AU - Lee, Dong Hoon

PY - 2013/2/8

Y1 - 2013/2/8

N2 - Hidden Vector Encryption (HVE) is a special type of predicate encryption that can support conjunctive equality and range searches on encrypted data. All previous HVE schemes were proven to be either selectively secure or weakly attribute-hiding. In this paper, we first construct a new HVE scheme that is fully secure under standard assumptions. Our HVE scheme, which is based on bilinear maps (pairings), provides efficiency advantages in that it requires O(1)-sized private keys and O(1) pairing computations for decryption, regardless of both the number of conjunctives and the dimension of vectors. To achieve our goal, we develop a novel technique to realize a tag-based dual system encryption in prime-order groups and show how to hide vector components and compress tag values into one.

AB - Hidden Vector Encryption (HVE) is a special type of predicate encryption that can support conjunctive equality and range searches on encrypted data. All previous HVE schemes were proven to be either selectively secure or weakly attribute-hiding. In this paper, we first construct a new HVE scheme that is fully secure under standard assumptions. Our HVE scheme, which is based on bilinear maps (pairings), provides efficiency advantages in that it requires O(1)-sized private keys and O(1) pairing computations for decryption, regardless of both the number of conjunctives and the dimension of vectors. To achieve our goal, we develop a novel technique to realize a tag-based dual system encryption in prime-order groups and show how to hide vector components and compress tag values into one.

KW - Dual system encryption

KW - Hidden vector encryption

KW - Predicate encryption

KW - Search on encrypted data

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

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

U2 - 10.1016/j.ins.2012.12.034

DO - 10.1016/j.ins.2012.12.034

M3 - Article

VL - 232

SP - 188

EP - 207

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -