Abstract
Public key encryption scheme with keyword search is a promising technique supporting search on encrypted data without leaking any information about the keyword. In real applications, it’s critical to find an effective revocation method to revoke users in multi-user cryptosystems, when user’s secret keys are exposed. In this paper, we propose the first designated server-aided revocable identity-based encryption scheme with keyword search (dSR-IBKS) from lattice. The dSR-IBKS model requires each user to keep just one private key corresponding with his identity and does not need to communicate with the key generation center or the server during key updating. We have proved that our scheme can achieve chosen keyword indistinguishability in the standard model. In particular, our scheme can designate a unique tester to test and return the search results, therefore no other entity can guess the keyword embedded in the ciphertext by generating search queries and doing the test by itself. We provide a formal security proof of our scheme assuming the hardness of the learning with errors problem on the standard model.
Highlights
In the cloud computing scenarios, data should be encrypted at first before uploaded to the cloud server, otherwise the privacy of sensitive information could be exposed
Boneh et al [1], initially constructed the public key encryption with keyword search (PEKS), in which ciphertext is encrypted with a ciphertext keyword and the public key of data receiver
In Boneh et al [14] proposed a revocation mechanism for identitybased encryption (IBE), in which the up-to-date revocation list is controlled by a trusted authority called Key Generation Center (KGC), who issues secret key skid||t for each non-revoked user id in every time period t
Summary
In the cloud computing scenarios, data should be encrypted at first before uploaded to the cloud server, otherwise the privacy of sensitive information could be exposed. In Boneh et al [14] proposed a revocation mechanism for IBE, in which the up-to-date revocation list is controlled by a trusted authority called Key Generation Center (KGC), who issues secret key skid||t for each non-revoked user id in every time period t. In this mechanism, only non-revoked users can decrypt ciphertext bound to their identity and the same time slot (i.e., id||t ). In Boldyreva et al [15] proposed another revocation mechanism based on the treebased revocation scheme of [16], and formalized the notion of revocable IBE (RIBE) In this mechanism, each user keeps O(log N ) long-term secret keys and the KGC broadcasts O(r log(N /r)) update keys for each time period t. One application of SR-IBE is encrypted email supporting lightweight devices in which an email server plays the role of the untrusted server so that only non-revoked users can read their email messages
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
