• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

New Public Key Encryption with Equality Test Based on non-Abelian Factorization Problems

Vol. 12, No.2, February 28, 2018
10.3837/tiis.2018.02.013, Download Paper (Free):

Abstract

In this paper, we present a new public key encryption scheme with equality test (PKEwET). Compared to other PKEwET schemes, we find that its security can be improved since the proposed scheme is based on non-Abelian factorization problems. To our knowledge, it is the first scheme regarding equality test that can resist quantum algorithm attacks. We show that our scheme is one-way against chosen-ciphertext attacks in the case that the computational Diffie-Hellman problem is hard for a Type-I adversary. It is indistinguishable against chosen-ciphertext attacks in the case that the Decisional Diffie-Hellman problem is hard in the random oracle model for a Type-II adversary. To conclude the paper, we demonstrate that our scheme is more efficient.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Huijun Zhu, Licheng Wang, Shuming Qiu and Xinxin Niu, "New Public Key Encryption with Equality Test Based on non-Abelian Factorization Problems," KSII Transactions on Internet and Information Systems, vol. 12, no. 2, pp. 764-785, 2018. DOI: 10.3837/tiis.2018.02.013

[ACM Style]
Zhu, H., Wang, L., Qiu, S., and Niu, X. 2018. New Public Key Encryption with Equality Test Based on non-Abelian Factorization Problems. KSII Transactions on Internet and Information Systems, 12, 2, (2018), 764-785. DOI: 10.3837/tiis.2018.02.013