CCA–secure publicly verifiable public key encryption scheme without pairings. (2015)

• Record Type: Journal Article
• Authors: Liu, Zhen; Yang, Xiaoyuan; Pan, Feng; Wei, Yuechuan
• Is Part Of: International journal of grid and utility computing. Volume 6:Number 2(2015)
• Page Start: 74
• Page End: 82
• Publication Date: 2015
• Subjects: public key encryption -- cryptography -- public verifiability -- bilinear pairings -- factoring -- CCA -- chosen ciphertext attacks -- publicly verifiable encryption -- threshold schemes -- security; Electronic data processing -- Distributed processing -- Periodicals; Electronic commerce -- Management -- Computer programs -- Periodicals; 004.605
• Languages: English
• ISSNs: 1741-847X

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.