On the incomparability of cache algorithms in terms of timing leakage

MaRDI QIDQ3121523zbMATH OpenFDO

Authors Pablo Cañones, Boris Köpf, Jan Reineke

Publication date 18 March 2019

Full work available at URL https://arxiv.org/abs/1807.01240

zbMATH Keywords

cache algorithmscache memorycompetitivenesssecurity

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer security (68M25) Analysis of algorithms (68W40)

Recommendations

• Security Analysis of Cache Replacement Policies
• An Analytical Model for Time-Driven Cache Attacks
• A formal analysis of prefetching in profiled cache-timing attacks on block ciphers
• Tempus fugit: How to plug it
• Topics in Cryptology – CT-RSA 2006

Cites work

• Cache Based Remote Timing Attack on the AES
• Competitive paging algorithms
• Information theory and security: Quantitative information flow
• On the Foundations of Quantitative Information Flow
• Security Analysis of Cache Replacement Policies
• Topics in Cryptology – CT-RSA 2006

Cited in

(3)

• A formal analysis of prefetching in profiled cache-timing attacks on block ciphers
• Security Analysis of Cache Replacement Policies
• TACLC: Timing-Aware Cache Leakage Control for Hard Real-Time Systems

Describes a project that uses

Uses Software

• SPEC Benchmarks
• CacheAudit

This page was built for publication: On the incomparability of cache algorithms in terms of timing leakage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121523)