Showing papers by "V. Kamakoti published in 2001"
16 Dec 2001
TL;DR: A secure threshold protocol for n players tolerating an adversary structure A is feasible iff maxa?A |a| 0 (and hence inapproximable within? (lg |A|)), unless NP? DTIME(n log log n), where N* is the optimum solution.
Abstract: A secure threshold protocol for n players tolerating an adversary structure A is feasible iff maxa?A |a| 0 (and hence inapproximable within ? (lg |A|)), unless NP ? DTIME(nlog log n), where N* is the optimum solution.
1 citations