1419 search results - page 282 / 284 » Notes on Formalizing Context |
107
click to vote
TCS
2010
15 years 1 months ago
2010
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
143
click to vote
ASIACRYPT
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
147
click to vote
EMSOFT
2010
Springer
15 years 1 months ago
2010
Springer
Constructing correct distributed systems from their high-level models has always been a challenge and often subject to serious errors because of their non-deterministic and non-at...
164
click to vote
FDTC
2010
Springer
15 years 1 months ago
2010
Springer
Fault injections constitute a major threat to the security of embedded systems. The errors in the cryptographic algorithms have been shown to be extremely dangerous, since powerful...
156
click to vote
DAM
2011
14 years 10 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...