Public Key Searchable Encryption without Random Oracle

Provided by: Binary Information Press
Topic: Security
Format: PDF
In this paper, the authors describe a new Public key Encryption with Keyword Search (PEKS) scheme, which is semantically secure against chosen keyword attack, without assuming random oracle. The security of their scheme depends on the complexity assumption of Strong Diffie-Hellman (SDH). The computation operation for constructing cipher text and trapdoor of keyword is simpler than the most schemes introduced before, and the complexity of searching in their scheme is lower than many schemes. Moreover, comparing with the previous system, their PEKS which is based on standard model has higher security.

Find By Topic