Sciweavers

Share
976 search results - page 1 / 196
» Evaluating Adversarial Partitions
Sort
View
ESORICS
2010
Springer
10 years 3 months ago
Evaluating Adversarial Partitions
Andreas Pashalidis, Stefan Schiffner
ICASSP
2011
IEEE
9 years 6 months ago
Informed secure watermarking using optimal transport
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...
Patrick Bas
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
10 years 8 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
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...
Sophie Laplante, Troy Lee, Mario Szegedy
AAAI
1996
10 years 4 months ago
Incorporating Opponent Models into Adversary Search
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 ...
David Carmel, Shaul Markovitch
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
10 years 6 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
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...
Jens Groth
books