%0 Conference Proceedings
%T A New Approach for Private Searches on Public-Key Encrypted Data
%+ Université Paris 13 (UP13)
%+ Université Paris 8 Vincennes-Saint-Denis (UP8)
%A Siad, Amar
%Z Part 2: Work in Progress
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 13th International Conference on Communications and Multimedia Security (CMS)
%C Canterbury, United Kingdom
%Y Bart Decker
%Y David W. Chadwick
%I Springer
%3 Communications and Multimedia Security
%V LNCS-7394
%P 160-173
%8 2012-09-03
%D 2012
%R 10.1007/978-3-642-32805-3_13
%K Threshold Searchable Encryption
%K Public key Encryption with Keyword Search
%K Blind Identity-Based Encryption
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Public-key Encryption with Keyword Search (PEKS) allows authorized users to search by keywords on encrypted data by generating trapdoors for the desired keywords. Basically there are two requirements for the process of trapdoors generation. On one hand, it is important to allow users to privately search on encrypted data without revealing keywords to the Trapdoor Generation Entity $\mathcal{TGE}$, and solutions proposed are based on the use of blinding protocols between user and $\mathcal{TGE}$. On the other hand, in some applications it is necessary to prevent $\mathcal{TGE}$ from generating trapdoors on behalf of a legitimate user, this is done by splitting the $\mathcal{TGE}$ and generating trapdoors in distributed manner. Until now, these two requirements in PEKS were considered separately and many solutions were proposed dealing with each one. However, no solution is known to satisfy the two requirements at the same time.In this paper we present a new approach to deal with this issue. First, we extend the notion of anonymous Identity-Based Encryption with distributed Private Key Generator to handle the blind key-extraction protocols as in Blind IBE. We call such new schemes blind anonymous (n,t)-IBE, and we give concrete construction of such schemes. Second, we generically transform the blind anonymous (n,t)-IBE into a threshold PEKS with oblivious keyword search satisfying the requirements specified above.
%G English
%Z TC 6
%Z TC 11
%2 https://inria.hal.science/hal-01540893/document
%2 https://inria.hal.science/hal-01540893/file/978-3-642-32805-3_13_Chapter.pdf
%L hal-01540893
%U https://inria.hal.science/hal-01540893
%~ UNIV-PARIS13
%~ UNIV-PARIS8
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-TC6
%~ IFIP-CMS
%~ IFIP-LNCS-7394
%~ UNIV-PARIS-LUMIERES
%~ SORBONNE-PARIS-NORD
%~ UNIV-PARIS8-OA