Efficient Multiplicative Sharing Schemes

  title={Efficient Multiplicative Sharing Schemes},
  author={Simon R. Blackburn and Mike Burmester and Yvo Desmedt and Peter R. Wild},
Multiplicative threshold schemes are useful tools in threshold cryptography. For example, such schemes can be used with a wide variety of practical homomorphic cryptosystems (such as the RSA, the El Gamal and elliptic curve systems) for threshold decryption, signatures, or proofs. The paper describes a new recursive construction for multiplicative threshold schemes which makes it possible to extend the number of users of such schemes for a relatively small expansion of the share size. We… CONTINUE READING