Enabling the Use of Strongly-Private Algorithms Kubilay Ahmet Kk - PowerPoint PPT Presentation

Mar 06, 2023 •214 likes •309 views

DEPARTMENT OF COMPUTER SCIENCE SOFTWARE AND SYSTEMS SECURITY RESEARCH GROUP Enabling the Use of Strongly-Private Algorithms Kubilay Ahmet Kk (PhD candidate, 4 th year) kucuk@cs.ox.ac.uk Supervisor: Prof. Andrew MARTIN Content from

DEPARTMENT OF COMPUTER SCIENCE SOFTWARE AND SYSTEMS SECURITY RESEARCH GROUP Enabling the Use of Strongly-Private Algorithms Kubilay Ahmet Küçük (PhD candidate, 4 th year) kucuk@cs.ox.ac.uk Supervisor: Prof. Andrew MARTIN Content from Journal Article, accepted on 03th May 2019. To be appear online in Jul/Aug 2019. KA Kucuk, David Grawrock, Andrew Martin. Managing confidentiality leaks through private algorithms on Software Guard eXtensions (SGX) enclaves: Minimised TCB on secret-code execution with Early-Private Mode (EPM). SpringerOpen EURASIP Journal on Information Security (Special Issue on Recent Advances in Software Security).
Enclave binary is inspectable by its’ nature Hardware Owner's Algorithm Owner's Sending Enclave Binary Fill Key: Asset Type Environment Environment Source Code U n t Compiled Binary r u Untrusted Application Part s Encrypted Memory Encrypted t e Enclave Memory d 4KB Page Trusted Granularity Interface Controlled by T Auto Operating r Generated System u s ECALL t OCALL e Functions d Binary Loaded Compiled binary disassembled Programming the Enclave functions to Enclave Memory objdump -d enclave.signed.so Containing Application Logic Time before Enclave loaded into memory After Loading Binary 2 Questions or Contact :kucuk@cs.ox.ac.uk
Enclave-Aware or Enclave-Independent development Algorithm Owner (AO) Approach 1: AO and ED on the same side Approach 2: HO and ED together Has Secret Algorithm Protect the Secret-Code Before Release Protect the Secret-Code After Release or Business Logic HO AO HO Hardware Owner (HO) has Cloud Infrastructure for Remote Execution ED AO Enclave Developer (ED) ED Responsible for Secure Implementation Sending an Enclave- aware Algorithm Sending an Enclave- independent Algorithm Ensuring the code secrecy before its release Maintaining the code secrecy after its release 3 Questions or Contact :kucuk@cs.ox.ac.uk
Enclave-Independent Private Algorithms 4 Questions or Contact :kucuk@cs.ox.ac.uk
Enclave-Aware Private Algorithms 5 Questions or Contact :kucuk@cs.ox.ac.uk
New Possibilities with 3 Stake Holders § Computational Power as a Service (CPaaS) § Algorithm Querying as a Service (AQaaS) § Data Querying as a Service (DQaaS) 6 Questions or Contact :kucuk@cs.ox.ac.uk
New Problems / Future Work § Integrate Key sharing and separation ( KSS ) § Modular Attestation § Secure Erase § Ownership Transfer § … Contact: kucuk@cs.ox.ac.uk Read more à 7 Questions or Contact :kucuk@cs.ox.ac.uk

Recommend

Strongly connected components Finding strongly-connected components A strongly connected component

Strongly connected components Finding strongly-connected components A strongly connected component is the maximal subset of a graph with a directed path between any two vertices B Tyler Moore CSE 3353, SMU, Dallas, TX g e Lecture 9 f a b

166 views • 5 slides

Enabling Fast Per-CPU User-Space Algorithms with Restartable Sequences

Linux Plumbers Conference 2016 Enabling Fast Per-CPU User-Space Algorithms with Restartable Sequences mathieu.desnoyers@efcios.com What are Restartable Sequences (rseq) ? Idea originating from Paul Turner and Andrew Hunter (Google),

349 views • 24 slides

Non-equilibrium Non-equilibrium Fluctuations in Strongly Fluctuations in Strongly Correlated

International Symposium in Honor of Professor Nambu for the 10th Anniversary of his Nobel Prize in Physics Osaka City University, December 12-13, 2018 Non-equilibrium Non-equilibrium Fluctuations in Strongly Fluctuations in Strongly

490 views • 36 slides

CSE 521 Algorithms Depth First Search and Strongly Connected Components W.L. Ruzzo, Winter 2013

CSE 521 Algorithms Depth First Search and Strongly Connected Components W.L. Ruzzo, Winter 2013 1 Undirected Depth-First Search Key Properties: 1. No cross-edges ; only tree- or back-edges 2. Before returning, DFS(v) visits all

984 views • 32 slides

PromotingDutchT anzanianBusiness Howcanthe Dutch government help? Public Enabling Private

PromotingDutchT anzanianBusiness Howcanthe Dutch government help? Public Enabling Private environment Partnerships 1) Knowledge and information Tools and instruments: Information www.rvo.nl tanzania.nlembassy.org/ Advice

825 views • 25 slides

Introduction (1) 1990s: Liberalization of SSA input markets Although continued intervention

2/22/18 Partnership for Enabling Market Environments Partnership for Enabling Market Environments for Fertilizer in Africa (PEMEFA) for Fertilizer in Africa (PEMEFA) Creating an enabling environment for private sector investment in fertilizer

707 views • 23 slides

Science Attitudes Rank each question 1 5 where 1 is strongly agree and 5 is strongly disagree

Science Attitudes Rank each question 1 5 where 1 is strongly agree and 5 is strongly disagree 1.I enjoy science 2.Science is useful in everyday life 3.Doing science often makes me feel nervous or upset 4.Science challenges me to use my mind

216 views • 19 slides

Block Ciphers Fall 2010 CS 334: Computer Security 1 Recall: Private-Key Encryption Algorithms

Block Ciphers Fall 2010 CS 334: Computer Security 1 Recall: Private-Key Encryption Algorithms Also called single-key or symmetric key algorithms Both parties share the key needed to encrypt and decrypt messages, hence both parties are

916 views • 48 slides

Strongly Connected Components Detection Strongly Connected Components A directed graph is

Company LOGO Strongly Connected Components Detection Strongly Connected Components A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. The strongly connected components

177 views • 15 slides

Strongly paired fermions Alexandros Gezerlis TALENT/INT Course on Nuclear forces and their

Strongly paired fermions Alexandros Gezerlis TALENT/INT Course on Nuclear forces and their impact on structure, reactions and astrophysics July 4, 2013 Strongly paired fermions Neutron matter & cold atoms Strongly paired fermions BCS

760 views • 48 slides

On strongly regular graphs attaining the claw bound M. Ma caj Comenius University,

On strongly regular graphs attaining the claw bound M. Ma caj Comenius University, Bratislava, Slovakia Villanova, June 5th 2014 Strongly regular graphs A k -regular graph on n vertices is strongly regular with parame- ters ( n, k, , )

523 views • 29 slides

15-853:Algorithms in the Real World Cryptography #2 15-853 Page 1 Cryptography Outline

15-853:Algorithms in the Real World Cryptography #2 15-853 Page 1 Cryptography Outline Introduction: terminology, cryptanalysis, security Private-Key Algorithms: Rijndael, DES Number Theory Groups Public-Key Algorithms: RSA, ElGamal,

525 views • 26 slides

Enabling Value Addition in Agriculture through Innovation and Entrepreneurship Maputo, Mozambique

Enabling Value Addition in Agriculture through Innovation and Entrepreneurship Maputo, Mozambique March 2012 About infoDev A donor funded program in the Financial and Private Sector Development Department of the World Bank Group Mission: To

126 views • 10 slides

Making Strongly-typed NETCONF Usable Ryan Goulding Colin Dixon The goals of YANG Strongly

Making Strongly-typed NETCONF Usable Ryan Goulding Colin Dixon The goals of YANG Strongly typed Machine consumable (Automatically) Catch errors early tl;dr Standard libraries should do lots of the work (serialization,

394 views • 26 slides

Strongly self-absorbing C -dynamical systems Classification and dynamical systems I: C

Strongly self-absorbing C -dynamical systems Classification and dynamical systems I: C -algebras Mittag-Leffler institute, Stockholm Gbor Szab WWU Mnster February 2016 1 / 24 Background & Motivation 1 Strongly

646 views • 53 slides

Estimating the Variance of Complex Differentially Private Algorithms Robert Ashmead JSM 2019,

Estimating the Variance of Complex Differentially Private Algorithms Robert Ashmead JSM 2019, Denver, Colorado Collaborators John Abowd, Philip Leclerc, and William Sexton of the U.S. Census Bureau and the entire team working on differentially

314 views • 30 slides

Some Families of Directed Strongly Regular Graphs Obtained from Certain Finite Incidence

Directed strongly regular graphs(DSRG) Combinatorial Designs Construction of Directed Strongly Regular Graphs References Some Families of Directed Strongly Regular Graphs Obtained from Certain Finite Incidence Structures Oktay Olmez

645 views • 37 slides

Connecting the Physical & Digital Worlds and Enabling Direct Brand-to-Consumer Mobile

Connecting the Physical & Digital Worlds and Enabling Direct Brand-to-Consumer Mobile Engagement Corporate Presentation September 2017 Safe Harbor Statement This report includes forward-looking statements covered by the Private Securities

416 views • 16 slides

Undirected Depth-First Search CSE 421 Introduction to Algorithms Its not just for trees

Undirected Depth-First Search CSE 421 Introduction to Algorithms Its not just for trees DFS(v) if v marked then return; back edge mark v; #v := ++count; Depth First Search and tree for all edges (v,w) do DFS(w); edge Strongly

319 views • 6 slides

Enabling Silicon-as-a-Service ENABLING SILICON-AS-A-SERVICE Algodone at a Glance When/Where

Adding SALT TM to Product Lifecycle Management (PLM) for IP tracking and Silicon Configuration Enabling Silicon-as-a-Service ENABLING SILICON-AS-A-SERVICE Algodone at a Glance When/Where Founders Vision Technology Jrme Rampon Founded

712 views • 16 slides

PRIVATE vs. ZONE MAINTENANCE AGREEMENTS MAINTENANCE AGREEMENTS Ove Smidt ALCATEL-LUCENT

conference & convention enabling the next generation of networks & services PRIVATE vs. ZONE MAINTENANCE AGREEMENTS MAINTENANCE AGREEMENTS Ove Smidt ALCATEL-LUCENT conference & convention enabling the next generation of networks

952 views • 22 slides

Greedy Algorithms Chapter 16 1 CPTR 430 Algorithms Greedy Algorithms Greedy Algorithms For

Greedy Algorithms Chapter 16 1 CPTR 430 Algorithms Greedy Algorithms Greedy Algorithms For some optimization problems, dynamic programming algorithms are overkill A greedy algorithm always makes a choice that looks best at the moment

1.09k views • 65 slides

Efficient Algorithms for Public-Private Social Networks Flavio Chierichetti Vahab Mirrokni

Efficient Algorithms for Public-Private Social Networks Flavio Chierichetti Vahab Mirrokni Alessandro Epasto Ravi Kumar Silvio Lattanzi Sapienza University Google Brown University Google Google KDD2015 Sydney, Australia August

663 views • 64 slides

The Strongly Intensive Cumulants Made Simple: A Simplifjed Explanation Geared T owards Intuitive

The Strongly Intensive Cumulants Made Simple: A Simplifjed Explanation Geared T owards Intuitive Understanding Evan Sangaline I was going to reuse a talk, but... Wojtek bets on a bottle of a good wine that it is impossible to get strongly

267 views • 24 slides