Cryptology ePrint Archive: Report 2013/749

Efficient CCA-secure Threshold Public-Key Encryption Scheme

Xi-Jun Lin and Lin Sun

Abstract: In threshold public-key encryption, the decryption key is divided into n shares, each one of which is given to a different decryption user in order to avoid single points of failure. In this study, we propose a simple and efficient non-interactive threshold public-key encryption scheme by using the hashed Diffie-Hellman assumption in bilinear groups. Compared with the other related constructions, the proposed scheme is more efficient.

Category / Keywords: public-key cryptography / Threshold public-key encryption; Chosen-ciphertext security; Hashed Diffie-Hellman assumption

Date: received 13 Nov 2013

Contact author: linxj77 at 163 com

Available format(s): PDF | BibTeX Citation

Version: 20131117:021456 (All versions of this report)

Short URL: ia.cr/2013/749

Discussion forum: Show discussion | Start new discussion