Skip to main content
placeholder image

Fully secure hidden vector encryption under standard assumptions

Journal Article


Download full-text (Open Access)

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. © 2013 Elsevier Inc. All rights reserved.

  • 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. © 2013 Elsevier Inc. All rights reserved.

UOW Authors


  •   Park, Jong Hwan (external author)
  •   Lee, Kwangsu (external author)
  •   Susilo, Willy
  •   Lee, Dong Hoon. (external author)

Publication Date


  • 2013

Citation


  • Park, J. Hwan., Lee, K., Susilo, W. & Lee, D. Hoon. (2013). Fully secure hidden vector encryption under standard assumptions. Information Sciences, 232 188-207.

Scopus Eid


  • 2-s2.0-84875423688

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1645&context=eispapers

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/639

Has Global Citation Frequency


Number Of Pages


  • 19

Start Page


  • 188

End Page


  • 207

Volume


  • 232

Place Of Publication


  • United States

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. © 2013 Elsevier Inc. All rights reserved.

  • 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. © 2013 Elsevier Inc. All rights reserved.

UOW Authors


  •   Park, Jong Hwan (external author)
  •   Lee, Kwangsu (external author)
  •   Susilo, Willy
  •   Lee, Dong Hoon. (external author)

Publication Date


  • 2013

Citation


  • Park, J. Hwan., Lee, K., Susilo, W. & Lee, D. Hoon. (2013). Fully secure hidden vector encryption under standard assumptions. Information Sciences, 232 188-207.

Scopus Eid


  • 2-s2.0-84875423688

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1645&context=eispapers

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/639

Has Global Citation Frequency


Number Of Pages


  • 19

Start Page


  • 188

End Page


  • 207

Volume


  • 232

Place Of Publication


  • United States