EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


20287 Public-Key Encryption with Delegated Search
Home Policy Brochure Browse Search User Area Contact Help

Ibraimi, L. and Nikova, S.I. and Hartel, P.H. and Jonker, W. (2011) Public-Key Encryption with Delegated Search. In: Proceedings of the 9th International Conference on Applied Cryptography and Network Security (ACNS), 7-10 Jun 2011, Nerja, Spain. pp. 532-549. Lecture Notes in Computer Science 6715. Springer Verlag. ISBN 978-3-642-21553-7

Full text available as:

PDF
- Univ. of Twente only
302 Kb

Official URL: http://dx.doi.org/10.1007/978-3-642-21554-4_31

Exported to Metis

Abstract

In a public key setting, Alice encrypts an email with the public key of Bob, so that only Bob will be able to learn the contents of the email. Consider a scenario where the computer of Alice is infected and unbeknown to Alice it also embeds a malware into the message. Bob’s company, Carol, cannot scan his email for malicious content as it is encrypted so the burden is on Bob to do the scan. This is not efficient. We construct a mechanism that enables Bob to provide trapdoors to Carol such that Carol, given an encrypted data and a malware signature, is able to check whether the encrypted data contains the malware signature, without decrypting it. We refer to this mechanism as public − key encryption with delegated search. We formalize and give a construction based on ElGamal public-key encryption. The proposed scheme has ciphertexts which are both searchable and decryptable. This property of the scheme is crucial since an entity can search the entire content of the message, in contrast to existing searchable public-key encryption schemes where the search is done only in the metadata part. We prove in the standard model that the scheme is ciphertext indistinguishable and trapdoor indistinguishable under the Symmetric External Diffie-Hellman (SXDH) assumption. We prove also the ciphertext one − wayness of the scheme under the modified Computational Diffie-Hellman (mCDH) assumption. We show that our scheme can be used in different applications such as detecting encrypted malware and forwarding encrypted email.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-DIES: Distributed and Embedded Security, EWI-DB: Databases
Research Program:CTIT-ISTRICE: Integrated Security and Privacy in a Networked World
Research Project:SPCMHD: Secure Patient-Centric Management of Health Data
ID Code:20287
Status:Published
Deposited On:26 June 2011
Refereed:Yes
International:Yes
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item