Reference : Trapdoor Privacy in Asymmetric Searchable Encryption Schemes
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/16437
Trapdoor Privacy in Asymmetric Searchable Encryption Schemes
English
Delerue Arriaga, Afonso mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Tang, Qiang mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Ryan, Peter mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2014
Progress in Cryptology -- AFRICACRYPT 2014, Marrakesh 28-30 May 2014
Yes
No
International
Africacrypt 2014
from 28-05-2014 to 30-05-2014
Marrakesh
Marocco
[en] Asymmetric Searchable Encryption ; PEKS ; Trapdoor Privacy ; Anonymous IBE ; Function Privacy ; Predicate Privacy ; Search Pattern Privacy ; Key Unlinkability
[en] Asymmetric searchable encryption allows searches to be carried over ciphertexts, through delegation, and by means of trapdoors issued by the owner of the data. Public Key Encryption with Keyword Search (PEKS) is a primitive with such functionality that provides delegation of exact-match searches. As it is important that ciphertexts preserve data privacy, it is also important that trapdoors do not expose the user’s search criteria. The difficulty of formalizing a security model for trapdoor privacy lies in the verification functionality, which gives the adversary the power of verifying if a trapdoor encodes a particular keyword. In this paper, we provide a broader view on what can be achieved regarding trapdoor privacy in asymmetric searchable encryption schemes, and bridge the gap between previous definitions, which give limited privacy guarantees in practice against search patterns. We propose the notion of Strong Search Pattern Privacy for PEKS and construct a scheme that achieves this security notion.
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/16437

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
se.pdfAuthor postprint447.9 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.