Security analysis of cache replacement policies

Cañones Martín, Pablo and Köpf, Boris and Reineke, Jan (2017). Security analysis of cache replacement policies. In: "6th International Conference on Principles of Security and Trust, POST 2017", 22-29 Apr 2017, Uppsala, Suecia. ISBN 978-3-662-54455-6. pp. 189-209. https://doi.org/10.1007/978-3-662-54455-6_9.

Description

Title: Security analysis of cache replacement policies
Author/s:
  • Cañones Martín, Pablo
  • Köpf, Boris
  • Reineke, Jan
Item Type: Presentation at Congress or Conference (Article)
Event Title: 6th International Conference on Principles of Security and Trust, POST 2017
Event Dates: 22-29 Apr 2017
Event Location: Uppsala, Suecia
Title of Book: Principles of Security and Trust
Date: 2017
ISBN: 978-3-662-54455-6
Volume: 10204
Subjects:
Freetext Keywords: Replacement policy; Cache line; Memory block; Attack strategy; Shared cache
Faculty: Facultad de Informática (UPM)
Department: Otro
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (414kB) | Preview

Abstract

Modern computer architectures share physical resources between different programs in order to increase area-, energy-, and cost- efficiency. Unfortunately, sharing often gives rise to side channels that can be exploited for extracting or transmitting sensitive information. We currently lack techniques for systematic reasoning about this interplay between security and efficiency. In particular, there is no established way for quantifying security properties of shared caches. In this paper, we propose a novel model that enables us to characterize important security properties of caches. Our model encompasses two aspects: (1) The amount of information that can be absorbed by a cache, and (2) the amount of information that can effectively be extracted from the cache by an adversary. We use our model to compute both quantities for common cache replacement policies (FIFO, LRU, and PLRU) and to compare their isolation properties. We further show how our model for information extraction leads to an algorithm that can be used to improve the bounds delivered by the CacheAudit static analyzer.

Funding Projects

TypeCodeAcronymLeaderTitle
Government of SpainTIN2012-39391-C04-01UnspecifiedFundación IMDEA SoftwareSound technologies for reliable, open new generation Software
Government of SpainTIN2015-70713-RUnspecifiedUnspecifiedDEDETIS
Madrid Regional GovernmentS2013/ICE-2731 NUnspecifiedIMDEA Software InstituteN-GREENS

More information

Item ID: 48201
DC Identifier: http://oa.upm.es/48201/
OAI Identifier: oai:oa.upm.es:48201
DOI: 10.1007/978-3-662-54455-6_9
Official URL: https://link.springer.com/chapter/10.1007/978-3-662-54455-6_9
Deposited by: Memoria Investigacion
Deposited on: 04 Apr 2018 11:14
Last Modified: 04 Apr 2018 11:14
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM