978 search results - page 23 / 196 » Knowledge, Probability, and Adversaries |
ICWSM
2008
13 years 8 months ago
2008
Managing privacy of online content is difficult. We present a simple social access control where sharers specify test questions of shared knowledge, such as "what is our scho...
PERCOM
2009
ACM
14 years 2 months ago
2009
ACM
—Due to the unattended nature of wireless sensor networks, an adversary can easily capture and compromise sensor nodes, generate replicas of those compromised nodes, and mount a ...
ISIPTA
1999
IEEE
13 years 11 months ago
1999
IEEE
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
The main purpose of this paper is to show that public key encryption can be secure against the "encryption emulation" attack (on the sender's encryption) by computat...
COLOGNETWENTE
2010
13 years 6 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...