360 search results - page 72 / 72 » On Protection by Layout Randomization |
ATAL
2011
Springer
12 years 4 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
IACR
2011
12 years 4 months ago
2011
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
ASPLOS
2012
ACM
12 years 16 days ago
2012
ACM
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...
ASPLOS
2012
ACM
12 years 16 days ago
2012
ACM
Future microprocessors need low-cost solutions for reliable operation in the presence of failure-prone devices. A promising approach is to detect hardware faults by deploying low-...
EDBT
2012
ACM
11 years 7 months ago
2012
ACM
Web search logs contain extremely sensitive data, as evidenced by the recent AOL incident. However, storing and analyzing search logs can be very useful for many purposes (i.e. in...