Skip to main content
placeholder image

Witness-based searchable encryption

Journal Article


Abstract


  • © 2018 Elsevier Inc. We put forward a new cryptographic primitive called witness-based searchable encryption (WBSE), namely if w and x satisfy a witness relation, an encryption of (m, w) could be tested by a trapdoor of (m′ x) whether the keyword m′ is equal to m. The benefit of this primitive is to solve the challenging problem of keyword guessing attack in public-key searchable encryption. We construct a WBSE scheme in a generic way using smooth projective hash function (SPHF) as a building block and prove its WB-IND-CCA ciphertext security, WB-IND-TD trapdoor security and EUFT-CIA trapdoor unforgeability. Thanks to an efficient SPHF instantiation from Decisional Diffie–Hellman (DDH) assumption, we obtain an efficient WBSE instance without any pairing operation.

Authors


  •   Ma, Sha (external author)
  •   Mu, Yi (external author)
  •   Susilo, Willy
  •   Yang, Bo (external author)

Publication Date


  • 2018

Citation


  • Ma, S., Mu, Y., Susilo, W. & Yang, B. (2018). Witness-based searchable encryption. Information Sciences, 453 364-378.

Scopus Eid


  • 2-s2.0-85046169524

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/1366

Number Of Pages


  • 14

Start Page


  • 364

End Page


  • 378

Volume


  • 453

Place Of Publication


  • United States

Abstract


  • © 2018 Elsevier Inc. We put forward a new cryptographic primitive called witness-based searchable encryption (WBSE), namely if w and x satisfy a witness relation, an encryption of (m, w) could be tested by a trapdoor of (m′ x) whether the keyword m′ is equal to m. The benefit of this primitive is to solve the challenging problem of keyword guessing attack in public-key searchable encryption. We construct a WBSE scheme in a generic way using smooth projective hash function (SPHF) as a building block and prove its WB-IND-CCA ciphertext security, WB-IND-TD trapdoor security and EUFT-CIA trapdoor unforgeability. Thanks to an efficient SPHF instantiation from Decisional Diffie–Hellman (DDH) assumption, we obtain an efficient WBSE instance without any pairing operation.

Authors


  •   Ma, Sha (external author)
  •   Mu, Yi (external author)
  •   Susilo, Willy
  •   Yang, Bo (external author)

Publication Date


  • 2018

Citation


  • Ma, S., Mu, Y., Susilo, W. & Yang, B. (2018). Witness-based searchable encryption. Information Sciences, 453 364-378.

Scopus Eid


  • 2-s2.0-85046169524

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/1366

Number Of Pages


  • 14

Start Page


  • 364

End Page


  • 378

Volume


  • 453

Place Of Publication


  • United States