UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Efficient multiplicative sharing schemes

Blackburn, SR; Burmester, M; Desmedt, Y; Wild, PR; (1996) Efficient multiplicative sharing schemes. In: Maurer, U, (ed.) ADVANCES IN CRYPTOLOGY - EUROCRYPT '96. (pp. 107 - 118). SPRINGER-VERLAG BERLIN

Full text not available from this repository.


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 discuss certain properties of the schemes, such as the information rate and zero knowledge aspects.The paper extends the Karnin-Greene-Hellman bound on the parameters of ideal secret sharing schemes to schemes which are not necessarily ideal and then uses this as a yardstick to compare the performance of currently known multiplicative sharing schemes.

Type: Proceedings paper
Title: Efficient multiplicative sharing schemes
Event: International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT 96)
Dates: 1996-05-12 - 1996-05-16
ISBN: 3-540-61186-X
URI: http://discovery.ucl.ac.uk/id/eprint/139084
Downloads since deposit
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item