International Association
for Cryptologic Research

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.