Sciweavers

5484 search results - page 9 / 1097
» Almost-Everywhere Secure Computation
Sort
View
ESORICS
2009
Springer
15 years 10 months ago
Using SAT-Solvers to Compute Inference-Proof Database Instances
Cornelia Tadros, Lena Wiese
ACISP
2008
Springer
15 years 9 months ago
A Tree-Based Approach for Computing Double-Base Chains
Christophe Doche, Laurent Habsieger
105
Voted
CCS
2007
ACM
15 years 9 months ago
Trusted computing challenges
Leendert van Doorn
CSFW
1997
IEEE
15 years 7 months ago
Unreliable Intrusion Detection in Distributed Computations
Dahlia Malkhi, Michael K. Reiter