Sökning: WFRF:(Stefanos Kaxiras) > ReCon :
Fältnamn | Indikatorer | Metadata |
---|---|---|
000 | 04006naa a2200397 4500 | |
001 | oai:DiVA.org:uu-525488 | |
003 | SwePub | |
008 | 240325s2023 | |||||||||||000 ||eng| | |
024 | 7 | a https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-5254882 URI |
024 | 7 | a https://doi.org/10.1145/3613424.36237702 DOI |
040 | a (SwePub)uu | |
041 | a engb eng | |
042 | 9 SwePub | |
072 | 7 | a ref2 swepub-contenttype |
072 | 7 | a kon2 swepub-publicationtype |
100 | 1 | a Aimoniotis, Pavlosu Uppsala universitet,Datorteknik4 aut0 (Swepub:uu)pavai350 |
245 | 1 0 | a ReCon :b Efficient Detection, Management, and Use of Non-Speculative Information Leakage |
264 | 1 | b Association for Computing Machinery (ACM),c 2023 |
338 | a electronic2 rdacarrier | |
520 | a In a speculative side-channel attack, a secret is improperly accessed and then leaked by passing it to a transmitter instruction. Several proposed defenses effectively close this security hole by either delaying the secret from being loaded or propagated, or by delaying dependent transmitters (e.g., loads) from executing when fed with tainted input derived from an earlier speculative load. This results in a loss of memory-level parallelism and performance. A security definition proposed recently, in which data already leaked in non-speculative execution need not be considered secret during speculative execution, can provide a solution to the loss of performance. However, detecting and tracking non-speculative leakage carries its own cost, increasing complexity. The key insight of our work that enables us to exploit non-speculative leakage as an optimization to other secure speculation schemes is that the majority of non-speculative leakage is simply due to pointer dereferencing (or base-address indexing) - essentially what many secure speculation schemes prevent from taking place speculatively. We present ReCon that: i) efficiently detects non-speculative leakage by limiting detection to pairs of directly-dependent loads that dereference pointers (or index a base-address); and ii) piggybacks non-speculative leakage information on the coherence protocol. In ReCon, the coherence protocol remembers and propagates the knowledge of what has leaked and therefore what is safe to dereference under speculation. To demonstrate the effectiveness of ReCon, we show how two state-of-the-art secure speculation schemes, Non-speculative Data Access (NDA) and speculative Taint Tracking (STT), leverage this information to enable more memorylevel parallelism both in a single core scenario and in a multicore scenario: NDA with ReCon reduces the performance loss by 28.7% for SPEC2017, 31.5% for SPEC2006, and 46.7% for PARSEC; STT with ReCon reduces the loss by 45.1%, 39%, and 78.6%, respectively. | |
650 | 7 | a NATURVETENSKAPx Data- och informationsvetenskapx Datavetenskap0 (SwePub)102012 hsv//swe |
650 | 7 | a NATURAL SCIENCESx Computer and Information Sciencesx Computer Sciences0 (SwePub)102012 hsv//eng |
653 | a Speculation | |
653 | a side-channels | |
653 | a load pair | |
653 | a non-speculative leakage | |
700 | 1 | a Kvalsvik, Amund Berglandu Norwegian Univ Sci & Technol, Trondheim, Norway.4 aut |
700 | 1 | a Chen, Xiaoyueu Uppsala universitet,Datorteknik4 aut0 (Swepub:uu)xiach215 |
700 | 1 | a Själander, Magnusu Norwegian Univ Sci & Technol, Trondheim, Norway.4 aut |
700 | 1 | a Kaxiras, Stefanosu Uppsala universitet,Datorteknik4 aut0 (Swepub:uu)steka984 |
710 | 2 | a Uppsala universitetb Datorteknik4 org |
773 | 0 | t 56th IEEE/ACM International Symposium on Microarchitecture, MICRO 2023d : Association for Computing Machinery (ACM)g , s. 828-842q <828-842z 9798400703294 |
856 | 4 | u https://doi.org/10.1145/3613424.3623770y Fulltext |
856 | 4 | u https://uu.diva-portal.org/smash/get/diva2:1846648/FULLTEXT01.pdfx primaryx Raw objecty fulltext:print |
856 | 4 8 | u https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-525488 |
856 | 4 8 | u https://doi.org/10.1145/3613424.3623770 |
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.