Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6856418 | Information Sciences | 2018 | 38 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Sha Ma, Yi Mu, Willy Susilo, Bo Yang,