976 search results - page 1 / 196 » Evaluating Adversarial Partitions |
ESORICS
2010
Springer
13 years 5 months ago
2010
Springer
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper presents several watermarking methods preventing the estimation of the secret key by an adversary. The constraints for secure embedding using distribution matching, whe...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
AAAI
1996
13 years 5 months ago
1996
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...
ACNS
2004
Springer
13 years 8 months ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...