Public key encryption schemes supporting equality test with authorisation of different granularity Online publication date: Tue, 30-Sep-2014
by Qiang Tang
International Journal of Applied Cryptography (IJACT), Vol. 2, No. 4, 2012
Abstract: In this paper, we extend the work about public key encryption schemes supporting fine-grained authorisation (FG-PKEET), done by Tang (2011b). First of all, we correct some flaws in Tang (2011b) and discuss how to extend the proposed cryptosystem to support approximate equality test. Secondly, we present a comparison between FG-PKEET and other similar primitives including AoN-PKEET by Tang (2011a) and PKEET by Yang et al. (2010), and demonstrate their differences in complexity and achieved security. Thirdly, to mitigate the inherent offline message recovery attacks, we extend FG-PKEET to a two-proxy setting, where two proxies need to collaborate in order to perform an equality test. Finally, we propose a cryptosystem and prove its security in the two-proxy setting.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Cryptography (IJACT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com