Journal
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
Volume 10, Issue 3, Pages 458-470Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIFS.2014.2378592
Keywords
Searchable encryption; public key encryption with equality test; flexible authorization
Funding
- National Natural Science Foundation of China [61402184, 61472146, 61370224, 61103232, 61272436, 61272404]
- Key Program of Natural Science Foundation of Hubei Province [2013CFA046]
- Open Fund Program for State Key Laboratory of Information Security
- Guangdong Natural Science Foundation [S2013010011859, 10351806001000000]
- Research Fund for the Doctoral Program of Higher Education of China [20114404120027]
Ask authors/readers for more resources
We reformalize and recast the notion of public key encryption with equality test (PKEET), which was proposed in CT-RSA 2010 and supports to check whether two ciphertexts encrypted under different public keys contain the same message. PKEET has many interesting applications, for example, in constructing searchable encryption and partitioning encrypted data. However, the original PKEET scheme lacks an authorization mechanism for a user to control the comparison of its ciphertexts with others'. In this paper, we study the authorization mechanism for PKEET, and propose four types of authorization policies to enhance the privacy of users' data. We give the definitions of the policies, propose a PKEET scheme supporting these four types of authorization at the same time, and prove its security based on the computational Diffie-Hellman assumption in the random oracle model. To the best of our knowledge, it is the only PKEET scheme supporting flexible authorization.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available