Name
Abstract | ||
|---|---|---|
An interpretation of the notion of software diversity is based on the concept of diversified process replicae. We define p, as the replica of a process p which behaves identically to p but has some "structural" diversiry from it. This makes possible to detect memory corruption attacks in a deterministic way. In our solution, p and p, differ in their address space which is properly diversified, thus defeating absolute and partial overwriting memory error exploits.We also give a characterization and a preliminary solution for shared memory management, one of the biggest practical issue introduced by this approach. Speculation on how to deal with synchronous signals delivery is faced as well.A user space proof-of-concept prototype has been implemented. Experimental results show a 68.93% throughput slowdown on a worst-case, while experiencing only a 1.20% slowdown on a best-case. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/PCCC.2007.358924 | 2007 IEEE INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE, VOLS 1 AND 2 |
Keywords | Field | DocType |
computer security,throughput,shared memory,proof of concept,error correction,memory management,prototypes | Memory protection,Shared memory,Computer science,Memory corruption,Computer network,Distributed memory,Theoretical computer science,Memory management,Flat memory model,User space,Distributed shared memory,Distributed computing | Conference |
ISSN | Citations | PageRank |
1097-2641 | 30 | 1.41 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Danilo Bruschi | 1 | 771 | 70.35 |
| Lorenzo Cavallaro | 2 | 886 | 52.85 |
| Andrea Lanzi | 3 | 845 | 40.99 |