30 search results - page 2 / 6 » Private combinatorial group testing |
CORR
2007
Springer
14 years 10 months ago
2007
Springer
IEEEARES
2008
IEEE
15 years 5 months ago
2008
IEEE
We consider a network of remote agent platforms that are tested by roaming spy agents in order to identify those that are malicious, based on the outcome of each agent. It is show...
100
click to vote
STOC
2004
ACM
15 years 11 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
CONNECTION
2004
14 years 10 months ago
2004
An astronomical set of sentences can be produced in natural language by combining relatively simple sentence structures with a human-size lexicon. These sentences are within the ra...
90
Voted
CRYPTO
2007
Springer
15 years 5 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...