360 search results - page 59 / 72 » On Protection by Layout Randomization |
CCS
2010
ACM
14 years 8 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
VTC
2010
IEEE
14 years 7 months ago
2010
IEEE
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...
83
Voted
ASIACRYPT
2010
Springer
14 years 7 months ago
2010
Springer
Blinding is a popular and well-known countermeasure to protect public-key cryptosystems against side-channel attacks. The high level idea is to randomize an exponentiation in order...
81
Voted
ICC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we describe a model for calculating the aggregate interference encountered by primary receivers in the presence of randomly placed cognitive radios (CRs). We show tha...
SIAMDM
2010
14 years 4 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...