DOCSLIB.ORG

Er Aw Dr a H Yt Ef As Yr Omemaw Dr a H Ro

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Er Aw Dr a H Yt Ef As Yr Omemaw Dr a H Ro ecneicS retupmoC fo tnemtrapeD tnemtrapeD fo fo retupmoC retupmoC ecneicS ecneicS - o- t o t l aA l aA DD DD 8/ 8/ HHardware-assistedardware-assisted 0202 0202 mmemoryemory safetysafety dna r dna r t se t j se j l l i L i LsnaH snaH HHansans Liljestrand Liljestrand ytefasytefas yromemyromem detsissa-erawdraHdetsissa-erawdraH BUSINESSBUSINESS + + ECONOMYECONOMY NSI I NBS NBS 879 879 - - 259 259 - - 06 06 - - 3198 3198 - 3 - 3 ( p ( p r i r n i n t t de de ) ) ARTART + + NSI I NBS NBS 879 879 - - 259 259 - - 06 06 - - 4198 4198 - 0 - 0 ( ( dp dp f ) f ) DESIGNDESIGN + + NSI I NSS NSS 9971 9971 - - 4394 4394 ( p ( p r i r n i n t t de de ) ) ARCHITECTUREARCHITECTURE NSI I NSS NSS 9971 9971 - - 2494 2494 ( ( dp dp f ) f ) SCIENCESCIENCE + + TECHNOLOGYTECHNOLOGY tirvn tlaA ot laA ot isrevinU isrevinU yt yt CROSSOVERCROSSOVER ceic fo oohcS oohcS l l o o f f cS i cS i ecne ecne DOCTORALDOCTORAL ecneicS retupmoC fo tnemtrapeD tnemtrapeD fo fo retupmoC retupmoC ecneicS ecneicS DOCTORALDOCTORAL DISSERTATIONSDISSERTATIONS +ddbjia*GMFTSH9 +ddbjia*GMFTSH9 fi.otlaa.www www . a . a a l t o l t o . fi . fi DISSERTATIONSDISSERTATIONS ot laA ot laA yt isrevinU yt isrevinU 0202 0202 seires noitacilbup ytisrevinU otlaA ytisrevinU noitacilbup seires SNOI TATRESS I D LAROTCOD D I TATRESS SNOI 8/ 0202 yea yoe esissa-erawdraH i dets yromem ytefas dna r t se j l i L snaH L i l j se t r dna fo rotcoD fo eerged eht rof detelpmoc noi tat ressid larotcod A larotcod ressid tat noi detelpmoc rof eht eerged fo rotcoD fo ht n sire e htiw,ddefe e ot g ncT( ceicS i ecne ( onhceT l ygo ) t o eb ed f dedne , w i t h t eh ep imr ss i no o f t eh ade o aiaec bpat eniSf ohSy seiUo laA ot isrevinU yt loohcS fo ,ecneicS ta a lbup ci tanimaxe noi dleh ta .0 1 00 yranJ 2 o oc e fo S lla erutc e t eh l ce t u r e ah l l 1SA o f t eh oohcs l no 02 aunaJ r y 0202 a t 21 : 00 . ytisrevinU otlaA ytisrevinU en S loohcS l o f cS i ecne en S po tnm apeD r nemt t o f upmoC t e r cS i ecne puorG smetsyS eruceS smetsyS puorG 4VQFSWJTJOHQSPGFTTPS 1SPGFTTPS/"TPLBO "BMUP6OJWFSTJUZ 'JOMBOE 5IFTJTBEWJTPS "EKVODU1SPGFTTPS+BO&SJL&LCFSH "BMUP6OJWFSTJUZ 'JOMBOE 1SFMJNJOBSZFYBNJOFST 1SPGFTTPS"VSÀMJFO'SBODJMMPO &63&$0. 'SBODF 1SPGFTTPS8JMMJBN&ODL /PSUI$BSPMJOB4UBUF6OJWFSTJUZ 64" 0QQPOFOU 1SPGFTTPS+VIB3ÍOJOH 6OJWFSTJUZPG0VMV 'JOMBOE "BMUP6OJWFSTJUZQVCMJDBUJPOTFSJFT %0$503"-%*44&35"5*0/4 )BOT-JMKFTUSBOE *4#/ QSJOUFE *4#/ QEG *44/ QSJOUFE *44/ QEG IUUQVSOGJ63/*4#/ 6OJHSBGJB0Z )FMTJOLJ WAN E S CO IC L D A B R E O L N 'JOMBOE Printed matter 4041-0619 tc sbA t r ca t A 70 ,001 o O ,ytisre UotlaA l t o nU i ev r s i t y , P .O. xoB 00011 , F I - 67000 aA l t o if.otlaa.www ro uA t oh r dnartsejliL aH n s L i l j e s t r a n d N ema fo eht larotcod noitatressid H detsissa-erawdra yromem ytefas resilbuP l i ehs r oohcS l o f cS i ecne tinU i t rapeD tnemt fo retupmoC cS i ecne seireS r i e s laA ot isrevinU yt lbup taci noi res sei LAROTCOD D I S TATRES SNOI 8/ 0202 h ee fo F i e l d o f aeser r hc noitamrofnI iruceS yt d mu tpircsunaM r i p t imbus t t de 72 ebmeceD r 9102 aD t e o f t eh ed f ecne 02 J auna r y 0202 )etad( detnarg ecnefed ci lbup rof noissimreP rof lbup ci ecnefed detnarg )etad( 02 eD ebmec r 102 9 egaugnaL nE g l i s h hargonoM r hpa rA t elci ressid tat noi yassE d i ress tat noi tc sbA t r ca t era sretupmoc tuB . sevi l yadyreve ruo otni detargetni ylesol c dna suot iuqibu era yadot sretupmoC yadot era iuqibu suot dna c ylesol detargetni otni ruo yadyreve l sevi . tuB sretupmoc era a sA .erawdrah tcefrepmi no nur dna snamuh elbi l laf yb net t irw era smargorP .erutan ni elkcfi ni .erutan smargorP era irw t net yb laf l elbi snamuh dna nur no tcefrepmi .erawdrah sA a of sx edmr nM.e brnu rmmy egl r mty rtpo luser t , retupmoc smetsys era deugalp yb yromem ibarenluv l i t .sei ynaM seidemer tsixe ; morf riqr ecopaeet u eaga ea-rmmo suihe gimropeisnefed evi gnimmargorp seuqinhcet ot efas-yromem segaugnal . tuB eseht sehcaorppa iuqer er tsum ew ,esu daerps-ediw eveihca oT .edoc gnitsixe fo gnitrop yltsoc dna esitrepxe-ytiruces dna yltsoc gnitrop fo gnitsixe .edoc oT eveihca daerps-ediw ,esu ew tsum laminim ht iw enod eb tsum s iht , revoeroM . segaugnal dna s loot gnits ixe otni yt i ruces etargetni ruces i yt otni ixe gnits loot s dna segaugnal . revoeroM , iht s tsum eb enod iw ht laminim tiomc i u e o gibea euaf tircs e to teyle n carfrep ecnamrof dna tnemyolped stsoc . weN ruces i yt serutaef era gnieb lor del tuo ni idommoc yt siht nI .ylevitceffe esu ot laivirt-non era tub ,ytiruces fo esimorp eht dloh yehT .erawdrah yehT dloh eht esimorp fo ,ytiruces tub era laivirt-non ot esu .ylevitceffe nI siht nmorprf rwrhhu s a nitteutn ei e po o osI nittesid tatress ,noi I wohs woh ipmoc -el emit tatnemurtsni noi nac esu hcus erawdrah rof tnamrofrep .snoitulos omem r y - s a f e t y s o l u t i o n s . stroppus AP .snoisnetxe XPM letnI dna AP A-3.8vMRA decudortni yltnecer eht erolpxe eW erolpxe eht yltnecer decudortni A-3.8vMRA AP dna letnI XPM .snoisnetxe AP stroppus ni sessenkaew sserdda ew od ylno toN . sretniop fo noi tacfii rev dna gningi s detarelecca-erawdrah s gningi dna rev tacfii noi fo sretniop . toN ylno od ew sserdda sessenkaew ni w,rlc a I tfs rmmrf nitls vnteepo a wtb,ssee ea-Prirp roi desab-AP sesnefed , tub ew la os tneserp evon l tulos snoi rof yromem ytefas . nI rap t raluci , ew ,noitcetorp sserdda nruter esicerp ,gnikcehc epyt emit-nur rof desu eb nac AP woh etartsnomed woh AP nac eb desu rof emit-nur epyt ,gnikcehc esicerp nruter sserdda ,noitcetorp atadatem yromem-ni sesu dna nwonk- l lew si noi tatnemurtsni -XPM ecapsresU .ytefas kcats dna kcats .ytefas ecapsresU -XPM tatnemurtsni noi si lew l nwonk- dna sesu yromem-ni atadatem gni su tub , yt i ruces rof tnuomarap s i l enrek ehT . sessecca yromem fo gnikcehc sdnuob edivorp ot edivorp sdnuob gnikcehc fo yromem sessecca . ehT enrek l i s tnuomarap rof ruces i yt , tub su gni XPM eht ,yromem nwo sti eganam tsum lenrek eht esuaceB .drawrofthgiarts ton si tcetorp ot XPM ot tcetorp si ton .drawrofthgiarts esuaceB eht lenrek tsum eganam sti nwo ,yromem eht XPM XPM cfiiceps-lenrek gnisu eussi siht diova ot woh wohs eW .esu ot elbisaef ton si atadatem si ton elbisaef ot .esu eW wohs woh ot diova siht eussi gnisu cfiiceps-lenrek XPM W.elaelve sti a—G tI h s hu—rwrhy ue tB.o anmrtsni t tatnemur .noi tuB ruces i yt hcus—erawdrah sa eht etnI l nac—XGS i t es l f eb lbarenluv e . eW t eue a nitteu si m e po whwh da enh-d XSltI tg tsevni etagi letnI XGS s lennahc-edi s , dna wohs woh ipmoc -el t emi tsni tatnemur noi nac eb desu ot .G okat nwdh-cabaeaitim t etagi a gniwodahs-hcnarb kcatta no .XGS n uy derv carfrplmnmeeic th smhs tircs nsr o a esi ihT s id ress tat noi tneserp s ruces i yt semehcs taht ihca eve laminim rep ecnamrof sdaehrevo yb su gni otni serutaef eseht setargetni noi tatnemur t sni emit -e l ipmoc ruO . erawdrah f l ehs-eht - f fo ni serutaef ni fo f - ehs-eht l f erawdrah . ruO ipmoc l -e emit sni t tatnemur noi setargetni eseht serutaef otni mt-limc n casisaeada etgT.o nven rplvdtoti dc n sixe ts gni edoc , iw tuoht repoleved tnevretni .noi rehtegoT , ssa-erawdrah i ecnats dna ipmoc -el emit fo smret ni sffo-edart lamitpo reffo taht snoitulos ytiruces sdrawot yaw eht sevap noitatnemurtsni sevap eht yaw sdrawot ytiruces snoitulos taht reffo lamitpo sffo-edart ni smret fo rweuu deasar nmea rh ,tY.ssc carfrpdateyle tnempoleved , tnemyolped dna rep ecnamrof stsoc . teY , ereht era ynam sdaor .daeha erutuF krow gnimmargorp nommoc nehw ,ecnatsni rof , sesab-edoc laer ht iw yt i l ibi tapmoc erolpxe dluohs erolpxe tapmoc ibi l i yt iw ht laer sesab-edoc , rof ,ecnatsni nehw nommoc gnimmargorp eaga rhoda + t ente bo a los rpu ovhbdnen oye srttap snret yler no denfiednu roivaheb . troppuS dluohs la os eb dednetxe ot ++C dna rehto segaugnal ; .sepyt cihpromylop dna snoitpecxe sa hcus stcurtsnoc egaugnal wen rof troppus seriuqer siht seriuqer troppus rof wen egaugnal stcurtsnoc hcus sa snoitpecxe dna cihpromylop .sepyt b,entsi o ,y ue dtsisaeada of finbo duc eaga efs-yromeM fas e segaugnal dluoc a l os tfieneb morf ssa-erawdrah i s det ruces i yt , rof sni ecnat , yb snoi tcer id eseht , rehtegoT .
Load more

Recommended publications
  • Deciding Memory Safety for Single-Pass Heap-Manipulating Programs
    Deciding Memory Safety for Single-Pass Heap-Manipulating Programs UMANG MATHUR, University of Illinois, Urbana-Champaign, USA ADITHYA MURALI, University of Illinois, Urbana-Champaign, USA PAUL KROGMEIER, University of Illinois, Urbana-Champaign, USA P. MADHUSUDAN, University of Illinois, Urbana-Champaign, USA MAHESH VISWANATHAN, University of Illinois, Urbana-Champaign, USA We investigate the decidability of automatic program verification for programs that manipulate heaps, andin particular, decision procedures for proving memory safety for them. We extend recent work that identified a decidable subclass of uninterpreted programs to a class of alias-aware programs that can update maps. We 35 apply this theory to develop verification algorithms for memory safetyÐ determining if a heap-manipulating program that allocates and frees memory locations and manipulates heap pointers does not dereference an unallocated memory location. We show that this problem is decidable when the initial allocated heap forms a forest data-structure and when programs are streaming-coherent, which intuitively restricts programs to make a single pass over a data-structure. Our experimental evaluation on a set of library routines that manipulate forest data-structures shows that common single-pass algorithms on data-structures often fall in the decidable class, and that our decision procedure is efficient in verifying them. CCS Concepts: • Theory of computation → Logic and verification; Automated reasoning. Additional Key Words and Phrases: Memory Safety, Program Verification, Aliasing, Decidability, Uninterpreted Programs, Streaming-Coherence, Forest Data-Structures ACM Reference Format: Umang Mathur, Adithya Murali, Paul Krogmeier, P. Madhusudan, and Mahesh Viswanathan. 2020. Deciding Memory Safety for Single-Pass Heap-Manipulating Programs. Proc. ACM Program.
    [Show full text]
  • Intra-Unikernel Isolation with Intel Memory Protection Keys
    Intra-Unikernel Isolation with Intel Memory Protection Keys Mincheol Sung Pierre Olivier∗ Virginia Tech, USA The University of Manchester, United Kingdom [email protected] [email protected] Stefan Lankes Binoy Ravindran RWTH Aachen University, Germany Virginia Tech, USA [email protected] [email protected] Abstract ACM Reference Format: Mincheol Sung, Pierre Olivier, Stefan Lankes, and Binoy Ravin- Unikernels are minimal, single-purpose virtual machines. dran. 2020. Intra-Unikernel Isolation with Intel Memory Protec- This new operating system model promises numerous bene- tion Keys. In 16th ACM SIGPLAN/SIGOPS International Conference fits within many application domains in terms of lightweight- on Virtual Execution Environments (VEE ’20), March 17, 2020, Lau- ness, performance, and security. Although the isolation be- sanne, Switzerland. ACM, New York, NY, USA, 14 pages. https: tween unikernels is generally recognized as strong, there //doi.org/10.1145/3381052.3381326 is no isolation within a unikernel itself. This is due to the use of a single, unprotected address space, a basic principle 1 Introduction of unikernels that provide their lightweightness and perfor- Unikernels have gained attention in the academic research mance benefits. In this paper, we propose a new design that community, offering multiple benefits in terms of improved brings memory isolation inside a unikernel instance while performance, increased security, reduced costs, etc. As a keeping a single address space. We leverage Intel’s Memory result,
    [Show full text]
  • “Sok: Eternal War in Memory”
    “SoK: Eternal War in Memory” Presented by Mengjia Yan MIT 6.888 Fall 2020 Overview • Discuss the paper “SoK: Eternal War in Memory” with concrete examples • Recent progress on memory safety • With a focus on hardware/architecture 2 Motivation • C/C++ is unsafe • EveryboDy runs C/C++ coDe • They surely have exploitable vulnerabilities 3 Low-level Language Basics (C/C++/Assembly) 0x00..0000 • Programmers have more control + Efficient OS memory - Bugs - Programming productivity TEXT (code) Global/Static • Pointers DATA • Address of variables (uint64): index of memory location where variable is stored Heap • Programmers need to do pointer check, e.g. NULL, out-of-bound, use-after-free Stack 0xFF..FFFF 4 Low-level Language Basics 0x00..0000 TEXT (code) Heap Stack 0xFF..FFFF 5 Low-level Language Basics TEXT (code) stack 6 Attacks Code Injection Attack Example TEXT (code) int func (char *str) { Shell code: char buffer[12]; strncpy(buffer, str, len(str)); PUSH “/bin/sh” CALL system stack return 1; } int main() { …. func (input); … } 8 Code Injection Attack TEXT (code) TEXT (code) stack stack buffer Shell code … … Return addr Return addr 9 Attacks 10 Return-Oriented Programming (ROP) int func (char *str) { TEXT (code) TEXT (code) char buffer[12]; strncpy(buffer, str, len(str)); stack stack return 1; } …. int main() { buffer …. … … func (input); Return addr Return addr … } 11 Attacks 12 HeartBleed Vulnerability • Publicly DiscloseD in April 2014 • Bug in the OpenSSL cryptographic software library heartbeat extension • Missing a bound check 13 Attacks
    [Show full text]
  • MPTEE: Bringing Flexible and Efficient Memory Protection to Intel
    MPTEE: Bringing Flexible and Efficient Memory Protection to Intel SGX Wenjia Zhao Kangjie Lu* Yong Qi* Saiyu Qi Xi’an Jiaotong University University of Minnesota Xi’an Jiaotong University Xidian University University of Minnesota Abstract code, emerge in today’s market. In particular, Intel has pro- Intel Software Guard eXtensions (SGX), a hardware-based vided SGX in its commodity processors, which supports a se- Trusted Execution Environment (TEE), has become a promis- cure region, namely enclave, to protect the internally loaded ing solution to stopping critical threats such as insider attacks code and data. Given its important and practical protection, and remote exploits. SGX has recently drawn extensive re- SGX has been extensively studied and used in practice. For search in two directions—using it to protect the confidentiality example, SCONE [1] uses it to effectively enhance the secu- and integrity of sensitive data, and protecting itself from at- rity of containers with low overhead. JITGuard [17] leverages tacks. Both the applications and defense mechanisms of SGX it to protect the security-critical just-in-time compiler oper- have a fundamental need—flexible memory protection that ations. SGXCrypter[49] utilizes it to securely unpack and updates memory-page permissions dynamically and enforces execute Windows binaries. There are many other useful appli- the least-privilege principle. Unfortunately, SGX does not pro- cations [35], [34], [31],[6], which confirm the practical and vide such a memory-protection mechanism due to the lack of promising applications of SGX. hardware support and the untrustedness of operating systems. Another line of research is to protect SGX itself from at- This paper proposes MPTEE, a memory-protection mech- tacks.
    [Show full text]
  • Intel® Xeon® E3-1200 V5 Processor Family
    Intel® Xeon® E3-1200 v5 Processor Family Specification Update May 2020 Revision 033 Reference Number: 333133-033US Intel technologies’ features and benefits depend on system configuration and may require enabled hardware, software or service activation. Learn more at Intel.com, or from the OEM or retailer. No computer system can be absolutely secure. Intel does not assume any liability for lost or stolen data or systems or any damages resulting from such losses. You may not use or facilitate the use of this document in connection with any infringement or other legal analysis concerning Intel products described herein. You agree to grant Intel a non-exclusive, royalty-free license to any patent claim thereafter drafted which includes subject matter disclosed herein. No license (express or implied, by estoppel or otherwise) to any intellectual property rights is granted by this document. The products described may contain design defects or errors known as errata which may cause the product to deviate from published specifications. Current characterized errata are available on request. Intel disclaims all express and implied warranties, including without limitation, the implied warranties of merchantability, fitness for a particular purpose, and non-infringement, as well as any warranty arising from course of performance, course of dealing, or usage in trade. Intel® Turbo Boost Technology requires a PC with a processor with Intel Turbo Boost Technology capability. Intel Turbo Boost Technology performance varies depending on hardware, software and overall system configuration. Check with your PC manufacturer on whether your system delivers Intel Turbo Boost Technology. For more information, see http://www.intel.com/ content/www/us/en/architecture-and-technology/turbo-boost/turbo-boost-technology.html Copies of documents which have an order number and are referenced in this document may be obtained by calling 1-800-548- 4725 or by visiting www.intel.com/design/literature.htm.
    [Show full text]
  • Sok: Hardware Security Support for Trustworthy Execution
    SoK: Hardware Security Support for Trustworthy Execution Lianying Zhao1, He Shuang2, Shengjie Xu2, Wei Huang2, Rongzhen Cui2, Pushkar Bettadpur2, and David Lie2 1Carleton Universityz, Ottawa, ON, Canada 2University of Toronto, Toronto, ON, Canada Abstract—In recent years, there have emerged many new hard- contribute to lowering power consumption, which is critical ware mechanisms for improving the security of our computer for resource-constrained devices. systems. Hardware offers many advantages over pure software Furthermore, hardware is the Root of Trust (RoT) [48], as approaches: immutability of mechanisms to software attacks, better execution and power efficiency and a smaller interface it bridges the physical world (where human users reside) and allowing it to better maintain secrets. This has given birth to the digital world (where tasks run as software). To securely a plethora of hardware mechanisms providing trusted execution perform a task or store a secret, the user trusts at least part of environments (TEEs), support for integrity checking and memory the computer hardware. safety and widespread uses of hardware roots of trust. Dedicated hardware security support has seen its prolif- In this paper, we systematize these approaches through the lens eration since the early days of computers. It can take a of abstraction. Abstraction is key to computing systems, and the interface between hardware and software contains many abstrac- straightforward form as discrete components to assist the tions. We find that these abstractions, when poorly designed, can CPU, ranging from the industrial-grade tamper-responding both obscure information that is needed for security enforcement, IBM Cryptocards (e.g., 4758 [37]), Apple’s proprietary secure as well as reveal information that needs to be kept secret, leading enclave processor (SEP [84]) for consumer electronics, to the to vulnerabilities.
    [Show full text]
  • Operating System Support for Run-Time Security with a Trusted Execution Environment
    Operating System Support for Run-Time Security with a Trusted Execution Environment - Usage Control and Trusted Storage for Linux-based Systems - by Javier Gonz´alez Ph.D Thesis IT University of Copenhagen Advisor: Philippe Bonnet Submitted: January 31, 2015 Contents Preface2 1 Introduction4 1.1 Context.......................................4 1.2 Problem.......................................6 1.3 Approach......................................7 1.4 Contribution....................................9 1.5 Thesis Structure.................................. 10 I State of the Art 12 2 Trusted Execution Environments 14 2.1 Smart Cards.................................... 15 2.1.1 Secure Element............................... 17 2.2 Trusted Platform Module (TPM)......................... 17 2.3 Intel Security Extensions.............................. 20 2.3.1 Intel TXT.................................. 20 2.3.2 Intel SGX.................................. 21 2.4 ARM TrustZone.................................. 23 2.5 Other Techniques.................................. 26 2.5.1 Hardware Replication........................... 26 2.5.2 Hardware Virtualization.......................... 27 2.5.3 Only Software............................... 27 2.6 Discussion...................................... 27 3 Run-Time Security 30 3.1 Access and Usage Control............................. 30 3.2 Data Protection................................... 33 3.3 Reference Monitors................................. 36 3.3.1 Policy Enforcement............................. 36 3.3.2
    [Show full text]
  • ERIM: Secure, Efficient In-Process Isolation with Protection Keys (MPK)
    ERIM: Secure, Efficient In-process Isolation with Protection Keys (MPK) AnjoVahldiek-Oberwagner EslamElnikety NunoO.Duarte Michael Sammler Peter Druschel Deepak Garg Max Planck Institute for Software Systems (MPI-SWS), Saarland Informatics Campus Abstract prevent control-flow hijacks [30], which could circumvent Isolating sensitive state and data can increase the security the bounds checks. On x86-64, pointer masking-based SFI and robustness of many applications. Examples include pro- techniques like Native Client [42] incur overheads of up to tecting cryptographic keys against exploits like OpenSSL’s 42% on the execution of untrusted code [30]. Even with Heartbleed bug or protecting a language runtime from na- hardware-supported bounds checks, like those supported by tive libraries written in unsafe languages. When runtime the IntelMPX ISA extension[26], the overheadis up to 30%, references across isolation boundaries occur relatively in- as shown in by Koning et al. [30] and later in Section 6.5. frequently, then conventional page-based hardware isola- Another approach is to use hardware page protection for tion can be used, because the cost of kernel- or hypervisor- memory isolation [9, 10, 13, 32, 33, 34]. Here, access checks mediated domain switching is tolerable. However, some are performed in hardware as part of the address translation applications, such as the isolation of cryptographic session with no additional overhead on execution within a compo- keys in network-facing services, require very frequent do- nent. However, transferring control between components main switching. In such applications, the overheadof kernel- requires a switch to kernel or hypervisor mode in order to or hypervisor-mediated domain switching is prohibitive.
    [Show full text]
  • Securing Intel Sgx Against Side-Channel Attacks Via Load-Time Synthesis
    SECURING INTEL SGX AGAINST SIDE-CHANNEL ATTACKS VIA LOAD-TIME SYNTHESIS A Dissertation Presented to The Academic Faculty By Ming-Wei Shih In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Georgia Institute of Technology Georgia Institute of Technology December 2019 Copyright © Ming-Wei Shih 2019 SECURING INTEL SGX AGAINST SIDE-CHANNEL ATTACKS VIA LOAD-TIME SYNTHESIS Approved by: Dr. Taesoo Kim, Advisor Dr. Michael Steiner School of Computer Science Security and Privacy Research Georgia Institute of Technology Group Intel Labs Dr. Wenke Lee School of Computer Science Dr. Brendan Saltaformaggio Georgia Institute of Technology School of Computer Science Georgia Institute of Technology Dr. Marcus Peinado Cloud and Infrastructure Security Date Approved: Octobor 23, 2019 Group Microsoft Research To my dear wife, Tiffany, and my family. ACKNOWLEDGEMENTS Foremost, I would like to express my sincere gratitude to my advisor Dr. Taesoo Kim for all the support and guidance he provided to me throughout my Ph.D. study. He has taught me how to conduct research in system security since my first year—when I literally know nothing about how to do so. His solid technical background and logical, critical thinking have always inspired me. I would also like to thank Dr. Marcus Peinado for always providing constructive comments when we collaborated on T-SGX and SGX-Armor. I have learned a lot from working with him. Besides, I would like to thank the rest of my thesis committee: Dr. Wenke Lee, Dr. Michael Steiner, and Dr. Brendan Saltaformaggio for their insightful comments that helped me improve this thesis.
    [Show full text]
  • Lessons Learned from Porting Helenos to RISC-V
    Lessons Learned from Porting HelenOS to RISC-V Martin Děcký [email protected] February 2019 Who Am I Passionate programmer and operating systems enthusiast With a specific inclination towards multiserver microkernels HelenOS developer since 2004 Research Scientist from 2006 to 2018 Charles University (Prague), Distributed Systems Research Group Senior Research Engineer since 2017 Huawei Technologies (Munich), German Research Center, Central Software Institute, OS Kernel Lab Martin Děcký, FOSDEM, February 2nd 2019 Lessons Learned from Porting HelenOS to RISC-V 2 HelenOS in a Nutshell open source general-purpose multiplatform microkernel multiserver operating system designed and implemented from scratch Martin Děcký, FOSDEM, February 2nd 2019 Lessons Learned from Porting HelenOS to RISC-V 4 HelenOS in a Nutshell open source general-purpose multiplatform microkernel multiserver operating system designed and implemented from scratch Custom microkernel Custom user space http://www.helenos.org Martin Děcký, FOSDEM, February 2nd 2019 Lessons Learned from Porting HelenOS to RISC-V 5 HelenOS in a Nutshell open source general-purpose multiplatform microkernel multiserver operating system designed and implemented from scratch 3-clause BSD permissive license https://github.com/HelenOS Martin Děcký, FOSDEM, February 2nd 2019 Lessons Learned from Porting HelenOS to RISC-V 6 HelenOS in a Nutshell open source general-purpose multiplatform microkernel multiserver operating system designed and implemented from scratch Breath-first rather than depth-first
    [Show full text]
  • Memory Corruption Mitigation Via Hardening and Testing
    Memory corruption mitigation via hardening and testing A Dissertation presented by László Szekeres to The Graduate School in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in Computer Science Stony Brook University May 2017 Copyright by László Szekeres 2017 Stony Brook University The Graduate School László Szekeres We, the dissertation committe for the above candidate for the Doctor of Philosophy degree, hereby recommend acceptance of this dissertation Dr. R. Sekar – Dissertation Advisor Professor, Department of Computer Science Dr. Scott Stoller – Chairperson of Defense Professor, Department of Computer Science Dr. Long Lu – Committee Member Assistant Professor, Department of Computer Science Dr. Franjo Ivančić – External Committee Member Staff Software Engineer, Google Adjunct Assistant Professor, Columbia University This dissertation is accepted by the Graduate School Charles Taber Dean of the Graduate School ii Abstract of the Dissertation Memory corruption mitigation via hardening and testing by László Szekeres Doctor of Philosophy in Computer Science Stony Brook University 2017 Despite decades of research, memory corruption vulnerabilities continue to be at the fore- front of today’s security threats. There are two main avenues for automating defenses against these vulnerabilities: (a) develop automated analysis/testing techniques to find these bugs, or (b) develop software transformations that block their exploitation, or at least make them more difficult (hardening). This dissertation explores both of these avenues. The thesis begins with a general model of memory corruption attacks and a systematic analysis of previous hardening techniques. We show that there none of the existing solutions protect against control-flow hijacks in a both effective and efficient manner.
    [Show full text]
  • Efficient Fault Tolerance Using Intel MPX And
    Efficient Fault Tolerance using Intel MPX and TSX Oleksii Oleksenko*, Dmitrii Kuvaiskii*, Pramod Bhatotia*, Christof Fetzer*, Pascal Felber** * Technische Universitat¨ Dresden, Germany ** University of Neuchatel,ˆ Switzerland Abstract—Hardware faults can cause data corruptions during Memory Memory computation, and they are especially harmful if these corruptions happen in data pointers. Existing solutions, however, incur high performance overheads, which is unacceptable for compute- out-of-bound access intensive applications. In this work, we present an efficient fault- tolerance approach against hardware faults by exploiting the new object bounds object bounds extensions to the x86 architecture. In particular, we propose that Intel MPX can be effectively used to detect faults in data pointers, while Intel TSX can provide roll-back recovery against these corruptions. Our preliminary evaluation supports this hypothesis, and we estimate the average overhead to be roughly around 50%. pointer corrupted pointer I. INTRODUCTION Critical components of the software stack such as operating (a) (b) systems, file systems, and databases are written in a low- level language (primarily, in C/C++) for improved performance Fig. 1: The concept of fault detection using MPX: (a) correct state, (b) a fault in pointer causes object bounds violation. and flexibility in memory management. However, the normal program flow can be arbitrarily corrupted by bit-flips in CPU protection and hardware transactional memory. In particu- or RAM during run-time. The resulting corruptions can lead lar, our approach is based on the new generations of Intel to catastrophic consequences; especially, if the corruption architecture—starting Skylake—with respective support for happens in data pointers—as they can cause the loss of the memory protection via MPX [4] and transactional memory whole data structure [1].
    [Show full text]