Skip to main content
placeholder image

Efficient public key encryption with revocable keyword search

Journal Article


Abstract


  • Public key encryption with keyword search (PEKS) is a novel cryptographic primitive enabling one to search

    on the encrypted data directly. In the known schemes, once getting a trapdoor, the server can search associated

    data without any restrictions. However, in reality, it is sometimes essential to prevent the server from searching

    the data all the time since the server is not fully trusted. In this paper, we propose the notion of public

    key encryption with revocable keyword search (PERKS) to address the issue. We also develop a concrete

    construction by dividing the whole life of the system into distinct time periods to achieve our goals. The

    proposed scheme achieves the properties of IND-CKA security under the Co-DBDH assumption in our security

    model. Compared with two somewhat schemes, ours oers much better performance in terms of computational

    cost.

UOW Authors


  •   Yu, Yong (external author)
  •   Ni, Jianbing (external author)
  •   Yang, Haomiao (external author)
  •   Mu, Yi (external author)
  •   Susilo, Willy

Publication Date


  • 2014

Citation


  • Yu, Y., Ni, J., Yang, H., Mu, Y. & Susilo, W. (2014). Efficient public key encryption with revocable keyword search. Security and Communication Networks, 7 (2), 466-472.

Scopus Eid


  • 2-s2.0-84893134547

Ro Metadata Url


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

Has Global Citation Frequency


Number Of Pages


  • 6

Start Page


  • 466

End Page


  • 472

Volume


  • 7

Issue


  • 2

Place Of Publication


  • United States

Abstract


  • Public key encryption with keyword search (PEKS) is a novel cryptographic primitive enabling one to search

    on the encrypted data directly. In the known schemes, once getting a trapdoor, the server can search associated

    data without any restrictions. However, in reality, it is sometimes essential to prevent the server from searching

    the data all the time since the server is not fully trusted. In this paper, we propose the notion of public

    key encryption with revocable keyword search (PERKS) to address the issue. We also develop a concrete

    construction by dividing the whole life of the system into distinct time periods to achieve our goals. The

    proposed scheme achieves the properties of IND-CKA security under the Co-DBDH assumption in our security

    model. Compared with two somewhat schemes, ours oers much better performance in terms of computational

    cost.

UOW Authors


  •   Yu, Yong (external author)
  •   Ni, Jianbing (external author)
  •   Yang, Haomiao (external author)
  •   Mu, Yi (external author)
  •   Susilo, Willy

Publication Date


  • 2014

Citation


  • Yu, Y., Ni, J., Yang, H., Mu, Y. & Susilo, W. (2014). Efficient public key encryption with revocable keyword search. Security and Communication Networks, 7 (2), 466-472.

Scopus Eid


  • 2-s2.0-84893134547

Ro Metadata Url


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

Has Global Citation Frequency


Number Of Pages


  • 6

Start Page


  • 466

End Page


  • 472

Volume


  • 7

Issue


  • 2

Place Of Publication


  • United States