Results 1 
4 of
4
On the Power of Nonlinear SecretSharing
 In Conf. on Computational Complexity
, 2001
"... A secretsharing scheme enables a dealer to distribute a secret among n parties such that only some predefined authorized sets of parties will be able to reconstruct the secret from their shares. The (monotone) collection of authorized sets is called an access structure, and is freely identified wit ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
A secretsharing scheme enables a dealer to distribute a secret among n parties such that only some predefined authorized sets of parties will be able to reconstruct the secret from their shares. The (monotone) collection of authorized sets is called an access structure, and is freely identified with its characteristic monotone function f : 1}. A family of secretsharing schemes is called efficient if the total length of the n shares is polynomial in n. Most previously known secretsharing schemes belonged to a class of linear schemes, whose complexity coincides with the monotone span program size of their access structure. Prior to this work there was no evidence that nonlinear schemes can be significantly more efficient than linear schemes, and in particular there were no candidates for schemes efficiently realizing access structures which do not lie in NC.
An Approach to Enhance InterProvider Roaming Through Secret Sharing and its Application to WLANs”, WMASH 2003
 In WMASH’05
, 2005
"... In this paper, we show how secret sharing can be used to address a number of shortcomings in stateoftheart publickeybased interprovider roaming. In particular, the new concept does not require costly operations for certificate validation by the mobile device. It furthermore eliminates the need ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
In this paper, we show how secret sharing can be used to address a number of shortcomings in stateoftheart publickeybased interprovider roaming. In particular, the new concept does not require costly operations for certificate validation by the mobile device. It furthermore eliminates the need for a secure channel between providers upon roaming. We demonstrate the new approach by introducing a new protocol, EAPTLSKS, for roaming between 802.11iprotected WLANs. In addition, we show that the properties of EAPTLSKS allow for an efficient integration of a micropayment scheme.
On the Composition of Secret Sharing Schemes Related to Codes
"... Abstract In this paper we construct a subclass of the composite access structure introduced in [9] based on schemes realizing the structure given by the set of codewords of minimal support of linear codes. This class enlarges the iterated threshold class studied in the same paper. Furthermore all t ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract In this paper we construct a subclass of the composite access structure introduced in [9] based on schemes realizing the structure given by the set of codewords of minimal support of linear codes. This class enlarges the iterated threshold class studied in the same paper. Furthermore all the schemes on this paper are ideal (in fact they allow a vector space construction) and we arrived to give a partial answer to a conjecture stated in