UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Computing functions of a shared secret

Beimel, A; Burmester, M; Desmedt, Y; Kushilevitz, E; (2000) Computing functions of a shared secret. SIAM J DISCRETE MATH , 13 (3) 324 - 345.

Full text not available from this repository.

Abstract

In this work we introduce and study threshold (t-out-of-n) secret sharing schemes for families of functions F. Such schemes allow any set of at least t parties to compute privately the value f(s) of a (previously distributed) secret s, for any f is an element of F. Smaller sets of players get no more information about the secret than what follows from the value f(s). The goal is to make the shares as short as possible. Results are obtained for two different settings: we study the case when the evaluation is done on a broadcast channel without interaction, and we examine what can be gained by allowing evaluations to be done interactively via private channels.

Type:Article
Title:Computing functions of a shared secret
Keywords:secret sharing, broadcast channel, private channels, interaction, private computations, EXTENDED ABSTRACT, SHARING SCHEMES, PRIVACY
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record