Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

7-2015

Abstract

Public Key Encryption with Keyword Search (PEKS), introduced by Boneh et al. in Eurocrypt’04, allows users to search encrypted documents on an untrusted server without revealing any information. This notion is very useful in many applications and has attracted a lot of attention by the cryptographic research community. However, one limitation of all the existing PEKS schemes is that they cannot resist the Keyword Guessing Attack (KGA) launched by a malicious server. In this paper, we propose a new PEKS framework named Dual-Server Public Key Encryption with Keyword Search (DS-PEKS). This new framework can withstand all the attacks, including the KGA from the two untrusted servers, as long as they do not collude. We then present a generic construction of DS-PEKS using a new variant of the Smooth Projective Hash Functions (SPHFs), which is of independent interest.

Keywords

Dual-server public key encryption with search, Smooth projective hash function

Discipline

Information Security

Research Areas

Information Systems and Management

Publication

Proceedings of the 20th Australasian Conference, Brisbane, Australia, 2015 June 29 - July 1

Volume

9144

First Page

59

Last Page

76

ISBN

9783319199610

Identifier

10.1007/978-3-319-19962-7_4

Publisher

Springer Verlag

City or Country

Brisbane, Australia

Additional URL

http://doi.org/10.1007/978-3-319-19962-7_4

Download

Share

COinS