Efficient forward-secure threshold public key encryption (Q2030875)

In this work, a forward-secure threshold public-key encryption scheme is proposed. This scheme is based on bilinear pairings with groups of prime order secure against adaptive and malicious adversaries in the standard model. The proposed scheme is new, interesting, and efficient since it has a non-interactive key update and decryption procedure. Additionally, the scheme does not require a trusted dealer and has optimal resilience, including small ciphertexts of constant size. It is the first scheme that achieves all of these, and that can also be implemented on standardized elliptic curves. For the entire collection see [Zbl 1461.68013].