You are looking at a specific version 20130602:170325 of this paper. See the latest version.

Paper 2013/330

Trapdoor Privacy in Asymmetric Searchable Encryption Schemes

Afonso Arriaga and Qiang Tang

Abstract

We investigate the open problem, namely trapdoor privacy, in asymmetric searchable encryption (ASE) schemes. We first present two trapdoor privacy definitions (i.e. 2-TRAP-PRIV and poly-TRAP-PRIV) which provide different levels of security guarantee. Motivated by the generic transformation from IBE to ASE, we introduce two key anonymity properties (i.e. 2-KEY-ANO and poly-KEY-ANO) for IBE schemes, so that these properties directly lead to the resulting ASE’s 2-TRAP-PRIV and poly-TRAP-PRIV properties respectively at the end of a transformation. We then present a simplified Boyen-Waters scheme and prove that it achieves IBE-IND-CPA, IBEANO (anonymity), and 2-KEY-ANO security in the random oracle model. Finally, we extend the simplified Boyen-Waters scheme to be based on pairings over composite-order groups and prove that the extended scheme achieves poly-KEY-ANO security without random oracles.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Searchable EncryptionTrapdoor PrivacyAnonymous IBE
Contact author(s)
qiang tang @ uni lu
History
2014-03-24: last of 2 revisions
2013-06-02: received
See all versions
Short URL
https://ia.cr/2013/330
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.