10 search results - page 2 / 2 » Strong (n, t, n) verifiable secret sharing scheme |
CISC
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In P2P file sharing systems, free-riders who use others’ resources without sharing their own cause system-wide performance degradation. Existing techniques to counter freerider...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...