CCA-secure publicly verifiable public key encryption scheme without pairings
by Zhen Liu; Xiaoyuan Yang; Feng Pan; Yuechuan Wei
International Journal of Grid and Utility Computing (IJGUC), Vol. 6, No. 2, 2015

Abstract: Publicly verifiable encryption scheme is a very powerful tool to construct many other interesting cryptographic schemes or protocols, and the existing publicly verifiable encryption schemes are based on special characters of bilinear pairings. But the inefficient computing restricts its application badly. So it is quite attractive and significantly worthwhile to construct cryptographic algorithms without pairings. Hofheinz and Kiltz's (2009b) scheme is a Chosen-Ciphertext Attacks (CCA)-secure public key encryption scheme under factoring assumption without pairings, but not a publicly verifiable construction. We improved Hofheinz and Kiltz's (2009b) scheme and realised publicly verifiable construct with CCA security by using the gap property that the decisional Diffie-Hellman problem is easy but the computational Diffie-Hellman problem is difficult as factoring over the group of signed quadratic residues. Furthermore, we improved the efficiency by instantiating this scheme over a semi-smooth subgroup. It can be used to construct threshold schemes without pairings.

Online publication date: Tue, 14-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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