Efficient Construction of CCA-Secure Threshold PKE Based on Hashed Diffie–Hellman Assumption | OUP Journals & Magazine | IEEE Xplore

Efficient Construction of CCA-Secure Threshold PKE Based on Hashed Diffie–Hellman Assumption

; ; ; ;

Abstract:

In threshold public-key encryption (TPKE), the decryption key is divided into n shares, each one of which is given to a different decryption user in order to avoid single...Show More

Abstract:

In threshold public-key encryption (TPKE), 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. A robust TPKE is that if threshold decryption of a valid ciphertext fails, the combiner can identify the decryption users that supplied invalid partial decryption shares. In this paper, we propose a practical and efficient TPKE scheme which is robust and non-interactive. Security against chosen-ciphertext attacks (CCAs) can be proved in the standard model under the hashed Diffie–Hellman assumption in bilinear groups. The security reduction is tight and simple. We use an instantiation hash function of the Kiltz's key encapsulation mechanism and Lai et al.'s chosen-ciphertext secure technique to construct a TPKE scheme. Moreover, our scheme is more simple and shown to be more efficient than currently existing CCA-secure TPKE schemes.
Published in: The Computer Journal ( Volume: 56, Issue: 10, October 2013)
Page(s): 1249 - 1257
Date of Publication: October 2013

ISSN Information: