The existence of refinement mappings
Theoretical Computer Science
Proving nondeterministically specified safety properties using progress measures
Information and Computation
A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Probabilistic Noninterference for Multi-Threaded Programs
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Building Diverse Computer Systems
HOTOS '97 Proceedings of the 6th Workshop on Hot Topics in Operating Systems (HotOS-VI)
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Discrete Event Dynamic Systems
Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Prevision domains and convex powercones
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Low-level software security: attacks and defenses
Foundations of security analysis and design IV
Independence from obfuscation: A semantic framework for diversity
Journal of Computer Security
Local Memory via Layout Randomization
CSF '11 Proceedings of the 2011 IEEE 24th Computer Security Foundations Symposium
On Protection by Layout Randomization
ACM Transactions on Information and System Security (TISSEC)
On layout randomization for arrays and functions
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
| Hi-index | 0.00 |
In security, layout randomization is a popular, effective attack mitigation technique. Recent work has aimed to explain it rigorously, focusing on deterministic systems. In this paper, we study layout randomization in the presence of nondeterministic choice. We develop a semantic approach based on denotational models and simulation relations. This approach abstracts from language details, and helps manage the delicate interaction between probabilities and nondeterminism.