Name
Abstract | ||
|---|---|---|
Memory corruption attacks may lead to complete takeover of systems. There are numerous works offering protection mechanisms for this important problem. But the security guarantees that are offered by most works are only heuristic and, furthermore, most solutions are designed for protecting the local memory. In this paper we initiate the study of provably secure remote memory attestation; we concentrate on provably detecting heap-based overflow attacks and consider the setting where we aim to protect the memory in a remote system. We present two protocols offering various efficiency and security trade-offs but all solutions are efficient enough for practical use as our implementation shows that detect the presence of injected malicious code or data in remotely-stored heap memory. While our solutions offer protection only against a specific class of attacks, our novel formalization of threat models is general enough to cover a wide range of attacks and settings. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-44618-9_5 | SCN |
Field | DocType | Volume |
Secret sharing,Message authentication code,Memory corruption,Computer security,Threat model,Computer science,Heap overflow,Heap (data structure),Memory management,Computer security model,Distributed computing | Conference | 9841 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.39 |
References | Authors | |
31 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandra Boldyreva | 1 | 2297 | 114.80 |
| Taesoo Kim | 2 | 809 | 51.85 |
| Richard J. Lipton | 3 | 6412 | 1796.57 |
| Bogdan Warinschi | 4 | 1514 | 68.98 |