Sciweavers

1419 search results - page 282 / 284
» Notes on Formalizing Context
Sort
View
TCS
2010
13 years 5 months ago
Invariant games
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 ...
Éric Duchêne, Michel Rigo
ASIACRYPT
2010
Springer
13 years 5 months ago
Structured Encryption and Controlled Disclosure
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 ...
Melissa Chase, Seny Kamara
EMSOFT
2010
Springer
13 years 5 months ago
From high-level component-based models to distributed implementations
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...
Borzoo Bonakdarpour, Marius Bozga, Mohamad Jaber, ...
FDTC
2010
Springer
132views Cryptology» more  FDTC 2010»
13 years 5 months ago
Fault Injection Resilience
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...
Sylvain Guilley, Laurent Sauvage, Jean-Luc Danger,...
DAM
2011
13 years 2 months ago
On minimal Sturmian partial words
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...
Francine Blanchet-Sadri, John Lensmire