3318 search results - page 49 / 664 » The Weak Instance Model |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
BPM
2006
Springer
13 years 11 months ago
2006
Springer
Current approaches for proving the correctness of business processes focus on either soundness, weak soundness, or relaxed soundness. Soundness states that each activity should be ...
ICISC
2001
13 years 9 months ago
2001
Although many strong cryptanalytic tools exploit weaknesses in the data-randomizinig part of a block cipher, relatively few general tools for cryptanalyzing on the other part, the ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...