Public key encryption schemes supporting equality test with authorisation of different granularity (Q1758884)

Summary: In this paper, we extend the work about public key encryption schemes supporting fine-grained authorisation (FG-PKEET) [the author, Lect. Notes Comput. Sci. 6812, 389--406 (2011; Zbl 1271.94024)]. First of all, we correct some flaws in [loc. cit.] 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 [the author, ``Public key encryption supporting plaintext equality test and user-specified authorization'', Secur. Commun. Netw. 5, No. 12, 1351--1362 (2012; \url{doi:10.1002/sec.418})] and PKEET [\textit{G. Yang} et al., Lect. Notes Comput. Sci. 5985, 119--131 (2010; Zbl 1271.94028)], 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.