Early Access articles are published articles within a journal that have not yet been assigned to a formal issue. This means they do not yet have a volume number, issue number, or page numbers assigned to them, however, they can still be found and cited using their DOI (Digital Object Identifier). Early Access publication benefits the research community by making new scientific discoveries known as quickly as possible.
Readers can access Early Access articles via the “Early Access” tab for the selected journal.
Public key encryption with equality test can provide a very simple add-on in which any one can directly perform testing over a pair of ciphertexts to check whether the underlying messages are identical or not without decryption. To restrict the such test power for different scenarios, that of delegated equality test is introduced to allow only the authenticated party to perform the test. In this paper, we focus on the security of public key encryption with filtered equality test (PKE-FET). The delegation to the party is only of a message set for designated testers in PKE-FET, which implies it cannot test any underlying message out of the set. We aim for investigating distinct security notions (static and adaptive security) with specific properties of the potential adversaries. Finally, we show the relationship between the security and complexity, and show the scheme of Huang et al. can reach adaptive security.
Citation: |
[1] |
K. Huang, R. Tso and Y.-C. Chen, Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption, Journal of Computer and System Sciences, 89 (2017), 400-409.
doi: 10.1016/j.jcss.2017.06.001.![]() ![]() ![]() |
[2] |
K. Huang, R. Tso, Y.-C. Chen, W. Li and H.-M. Sun, A new public key encryption with equality test, In International Conference on Network and System Security, Springer, 2015,550–557.
doi: 10.1007/978-3-319-11698-3_45.![]() ![]() |
[3] |
S. Ma, Identity-based encryption with outsourced equality test in cloud computing, Information Sciences, 328 (2016), 389-402.
![]() |
[4] |
S. Ma, Q. Huang, M. Zhang and B. Yang, Efficient public key encryption with equality test supporting flexible authorization, IEEE Transactions on Information Forensics and Security, 10 (2015), 458-470.
doi: 10.1109/TIFS.2014.2378592.![]() ![]() |
[5] |
S. Ma, M. Zhang, Q. Huang and B. Yang, Public key encryption with delegated equality test in a multi-user setting, The Computer Journal, 58 (2015), 986-1002.
doi: 10.1093/comjnl/bxu026.![]() ![]() |
[6] |
K. Peng, C. Boyd, E. Dawson and B. Lee, Ciphertext comparison, a new solution to the millionaire problem, In International Conference on Information and Communications Security, Springer, 3783 (2005), 84–96.
doi: 10.1007/11602897_8.![]() ![]() ![]() |
[7] |
Q. Tang, Public key encryption schemes supporting equality test with authorisation of different granularity, International Journal of Applied Cryptography, 2 (2012), 304-321.
doi: 10.1504/IJACT.2012.048079.![]() ![]() ![]() |
[8] |
G. Yang, C. H. Tan, Q. Huang and D. S. Wong, Probabilistic public key encryption with equality test, In Cryptographers'Track at the RSA Conference, Springer, 5985 (2010), 119–131.
doi: 10.1007/978-3-642-11925-5_9.![]() ![]() ![]() |