28 search results - page 6 / 6 » On the Optimization of Bipartite Secret Sharing Schemes |
CCS
2008
ACM
13 years 8 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...
CRYPTO
2007
Springer
14 years 12 days 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...
ACNS
2009
Springer
14 years 25 days ago
2009
Springer
We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and ...