z-logo
open-access-imgOpen Access
Efficient Proxy Re-encryption with Private Searching in the Untrusted Cloud
Author(s) -
Xi Chen,
Yong Li
Publication year - 2012
Publication title -
international journal of wireless and microwave technologies
Language(s) - English
Resource type - Journals
eISSN - 2076-9539
pISSN - 2076-1449
DOI - 10.5815/ijwmt.2012.01.08
Subject(s) - proxy re encryption , computer science , cloud computing , proxy (statistics) , encryption , cryptosystem , computer security , cryptography , public key cryptography , scheme (mathematics) , computer network , operating system , mathematics , machine learning , mathematical analysis
As promising as cloud computing is, this paradigm brings forth new security and privacy challenges when operating in the untrusted cloud scenarios. In this paper, we propose a new cryptographic primitive Proxy Reencryption with Private Searching (PRPS for short). The PRPS scheme enables the data users and owners efficiently query and access files storaged in untrusted cloud, while keeping query privacy and data privacy from the cloud providers. The concrete construction is based on proxy re-encryption, public key encryption with keyword search and the dual receiver cryptosystem. The scheme is semantically secure under the BDH assumption

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom