Reference : Trapdoor Privacy in Asymmetric Searchable Encryption Schemes

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/16437

Title :	Trapdoor Privacy in Asymmetric Searchable Encryption Schemes
Language :	English
Author, co-author :	Delerue Arriaga, Afonso [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Tang, Qiang [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Ryan, Peter [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	2014
Main document title :	Progress in Cryptology -- AFRICACRYPT 2014, Marrakesh 28-30 May 2014
Peer reviewed :	Yes
On invitation :	No
Audience :	International
Event name :	Africacrypt 2014
Event date :	from 28-05-2014 to 30-05-2014
Event place (city) :	Marrakesh
Event country :	Marocco
Keywords :	[en] Asymmetric Searchable Encryption ; PEKS ; Trapdoor Privacy ; Anonymous IBE ; Function Privacy ; Predicate Privacy ; Search Pattern Privacy ; Key Unlinkability
Abstract :	[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.
Target :	Researchers ; Professionals ; Students
Permalink :	http://hdl.handle.net/10993/16437

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access se.pdf Author postprint 447.9 kB View/Open

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map