optorama optimal oblivious ram
play

OptORAMa : Optimal Oblivious RAM Gilad Asharov Bar-Ilan University - PowerPoint PPT Presentation

Aug 05, 2023 •207 likes •578 views

OptORAMa : Optimal Oblivious RAM Gilad Asharov Bar-Ilan University Ilan Komargodski Wei-Kai Lin Kartik Nayak Enoch Peserico Elaine Shi Roadmap Introduction Problem definition and our result A short tutorial

  1. OptORAMa : Optimal Oblivious RAM Gilad Asharov Bar-Ilan University Ilan Komargodski Wei-Kai Lin Kartik Nayak Enoch Peserico Elaine Shi

  2. Roadmap • Introduction • Problem definition and our result • A short tutorial • From Square Root ORAM to OptORAMa • Our techniques

  3. Access Pattern Leakage (or, why encrypting the data is insufficient?) secure processor

  4. Access Pattern Leakage (or, why encrypting the data is insufficient?) Kidney Problem Liver Problem Heart Problem

  5. Oblivious RAM (or - How to Hide the Access Pattern?) Write(addr1,v) Write(addr2,v) Oblivious RAM Read(addr3) v

  6. Oblivious RAM • Introduced by Goldreich and Ostrovsky [STOC’87,STOC’90,JACM’96] • Informal definition: • The access pattern can be simulated from just the number of data accesses • The access pattern is data independent • Lower bound: memory N • Ω (log N) amortized overhead even with crypto [GoldreichOstrovsky96,LarsenNielsen18]

  7. <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="IPn2AcBbAldKUAZRIlnRI43Bgsg=">AB8nicbZDLSgMxFIbPeK31VnXpJliEuikzKuiy6MaVrAXmI4lk2ba0EwyJBmhDH0MNy4UcevTuPNtTNtZaOsPgY/nEPO+cOEM21c9tZWl5ZXVsvbBQ3t7Z3dkt7+0tU0Vog0guVTvEmnImaMw2k7URTHIaetcHg9qbeqNJMigczSmgQ475gESPYWMu/q3S47D+eoduTbqnsVt2p0CJ4OZQhV71b+ur0JEljKgzhWGvfcxMTZFgZRjgdFzupgkmQ9ynvkWBY6qDbLryGB1bp4ciqewTBk3d3xMZjrUexaHtjLEZ6PnaxPyv5qcmugwyJpLUEFmH0UpR0aiyf2oxQlho8sYKY3RWRAVaYGJtS0YbgzZ+8CM3Tqmf5/rxcu8rjKMAhHEFPLiAGtxAHRpAQMIzvMKbY5wX5935mLUuOfnMAfyR8/kDm/mQJQ=</latexit> <latexit sha1_base64="IPn2AcBbAldKUAZRIlnRI43Bgsg=">AB8nicbZDLSgMxFIbPeK31VnXpJliEuikzKuiy6MaVrAXmI4lk2ba0EwyJBmhDH0MNy4UcevTuPNtTNtZaOsPgY/nEPO+cOEM21c9tZWl5ZXVsvbBQ3t7Z3dkt7+0tU0Vog0guVTvEmnImaMw2k7URTHIaetcHg9qbeqNJMigczSmgQ475gESPYWMu/q3S47D+eoduTbqnsVt2p0CJ4OZQhV71b+ur0JEljKgzhWGvfcxMTZFgZRjgdFzupgkmQ9ynvkWBY6qDbLryGB1bp4ciqewTBk3d3xMZjrUexaHtjLEZ6PnaxPyv5qcmugwyJpLUEFmH0UpR0aiyf2oxQlho8sYKY3RWRAVaYGJtS0YbgzZ+8CM3Tqmf5/rxcu8rjKMAhHEFPLiAGtxAHRpAQMIzvMKbY5wX5935mLUuOfnMAfyR8/kDm/mQJQ=</latexit> <latexit sha1_base64="IPn2AcBbAldKUAZRIlnRI43Bgsg=">AB8nicbZDLSgMxFIbPeK31VnXpJliEuikzKuiy6MaVrAXmI4lk2ba0EwyJBmhDH0MNy4UcevTuPNtTNtZaOsPgY/nEPO+cOEM21c9tZWl5ZXVsvbBQ3t7Z3dkt7+0tU0Vog0guVTvEmnImaMw2k7URTHIaetcHg9qbeqNJMigczSmgQ475gESPYWMu/q3S47D+eoduTbqnsVt2p0CJ4OZQhV71b+ur0JEljKgzhWGvfcxMTZFgZRjgdFzupgkmQ9ynvkWBY6qDbLryGB1bp4ciqewTBk3d3xMZjrUexaHtjLEZ6PnaxPyv5qcmugwyJpLUEFmH0UpR0aiyf2oxQlho8sYKY3RWRAVaYGJtS0YbgzZ+8CM3Tqmf5/rxcu8rjKMAhHEFPLiAGtxAHRpAQMIzvMKbY5wX5935mLUuOfnMAfyR8/kDm/mQJQ=</latexit> <latexit sha1_base64="IPn2AcBbAldKUAZRIlnRI43Bgsg=">AB8nicbZDLSgMxFIbPeK31VnXpJliEuikzKuiy6MaVrAXmI4lk2ba0EwyJBmhDH0MNy4UcevTuPNtTNtZaOsPgY/nEPO+cOEM21c9tZWl5ZXVsvbBQ3t7Z3dkt7+0tU0Vog0guVTvEmnImaMw2k7URTHIaetcHg9qbeqNJMigczSmgQ475gESPYWMu/q3S47D+eoduTbqnsVt2p0CJ4OZQhV71b+ur0JEljKgzhWGvfcxMTZFgZRjgdFzupgkmQ9ynvkWBY6qDbLryGB1bp4ciqewTBk3d3xMZjrUexaHtjLEZ6PnaxPyv5qcmugwyJpLUEFmH0UpR0aiyf2oxQlho8sYKY3RWRAVaYGJtS0YbgzZ+8CM3Tqmf5/rxcu8rjKMAhHEFPLiAGtxAHRpAQMIzvMKbY5wX5935mLUuOfnMAfyR8/kDm/mQJQ=</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="(nul)">(nul)</latexit> <latexit sha1_base64="hJa7KJ6BNyQLXtaArIm3/a1FCuA=">AB8nicbZDLSgMxFIYzXmu9V26CRahbspMEXRZdONK9gLTMeSTNtaCYZkjNCGfoYblwo4tancefbmLaz0NYfAh/OYec84eJ4AZc9tZWV1b39gsbBW3d3b39ksHhy2jUk1ZkyqhdCckhgkuWRM4CNZJNCNxKFg7HF1P6+0npg1X8gHGCQtiMpA84pSAtfy7SleowWMN3571SmW36s6El8HLoYxyNXqlr25f0TRmEqgxviem0CQEQ2cCjYpdlPDEkJHZMB8i5LEzATZbOUJPrVOH0dK2ycBz9zfExmJjRnHoe2MCQzNYm1q/lfzU4gug4zLJAUm6fyjKBUYFJ7ej/tcMwpibIFQze2umA6JhRsSkUbgrd48jK0alXP8v15uX6Vx1FAx+gEVZCHLlAd3aAGaiKFHpGr+jNAefFeXc+5q0rTj5zhP7I+fwBmnKQJA=</latexit> <latexit sha1_base64="hJa7KJ6BNyQLXtaArIm3/a1FCuA=">AB8nicbZDLSgMxFIYzXmu9V26CRahbspMEXRZdONK9gLTMeSTNtaCYZkjNCGfoYblwo4tancefbmLaz0NYfAh/OYec84eJ4AZc9tZWV1b39gsbBW3d3b39ksHhy2jUk1ZkyqhdCckhgkuWRM4CNZJNCNxKFg7HF1P6+0npg1X8gHGCQtiMpA84pSAtfy7SleowWMN3571SmW36s6El8HLoYxyNXqlr25f0TRmEqgxviem0CQEQ2cCjYpdlPDEkJHZMB8i5LEzATZbOUJPrVOH0dK2ycBz9zfExmJjRnHoe2MCQzNYm1q/lfzU4gug4zLJAUm6fyjKBUYFJ7ej/tcMwpibIFQze2umA6JhRsSkUbgrd48jK0alXP8v15uX6Vx1FAx+gEVZCHLlAd3aAGaiKFHpGr+jNAefFeXc+5q0rTj5zhP7I+fwBmnKQJA=</latexit> <latexit sha1_base64="hJa7KJ6BNyQLXtaArIm3/a1FCuA=">AB8nicbZDLSgMxFIYzXmu9V26CRahbspMEXRZdONK9gLTMeSTNtaCYZkjNCGfoYblwo4tancefbmLaz0NYfAh/OYec84eJ4AZc9tZWV1b39gsbBW3d3b39ksHhy2jUk1ZkyqhdCckhgkuWRM4CNZJNCNxKFg7HF1P6+0npg1X8gHGCQtiMpA84pSAtfy7SleowWMN3571SmW36s6El8HLoYxyNXqlr25f0TRmEqgxviem0CQEQ2cCjYpdlPDEkJHZMB8i5LEzATZbOUJPrVOH0dK2ycBz9zfExmJjRnHoe2MCQzNYm1q/lfzU4gug4zLJAUm6fyjKBUYFJ7ej/tcMwpibIFQze2umA6JhRsSkUbgrd48jK0alXP8v15uX6Vx1FAx+gEVZCHLlAd3aAGaiKFHpGr+jNAefFeXc+5q0rTj5zhP7I+fwBmnKQJA=</latexit> <latexit sha1_base64="hJa7KJ6BNyQLXtaArIm3/a1FCuA=">AB8nicbZDLSgMxFIYzXmu9V26CRahbspMEXRZdONK9gLTMeSTNtaCYZkjNCGfoYblwo4tancefbmLaz0NYfAh/OYec84eJ4AZc9tZWV1b39gsbBW3d3b39ksHhy2jUk1ZkyqhdCckhgkuWRM4CNZJNCNxKFg7HF1P6+0npg1X8gHGCQtiMpA84pSAtfy7SleowWMN3571SmW36s6El8HLoYxyNXqlr25f0TRmEqgxviem0CQEQ2cCjYpdlPDEkJHZMB8i5LEzATZbOUJPrVOH0dK2ycBz9zfExmJjRnHoe2MCQzNYm1q/lfzU4gug4zLJAUm6fyjKBUYFJ7ej/tcMwpibIFQze2umA6JhRsSkUbgrd48jK0alXP8v15uX6Vx1FAx+gEVZCHLlAd3aAGaiKFHpGr+jNAefFeXc+5q0rTj5zhP7I+fwBmnKQJA=</latexit> <latexit sha1_base64="pKl6zuwEtmA0k4e3YRVwGonLN7I=">AB+nicbZDLSsNAFIZP6q3W6pLN4NFqJuSiKDLohtXtYK9QBPKZDpth04mcWailNhHceNCEbc+iTvfxmbhb+MPDxn3M4Z/4g5kxpx/m2ciura+sb+c3C1vbO7p5d3G+qKJGENkjEI9kOsKcCdrQTHPajiXFYcBpKxhdTeutByoVi8SdHsfUD/FAsD4jWBuraxdvyp6lzqtTweDVDtpGuXnIozE1oGN4MSZKp37S+vF5EkpEITjpXquE6s/RLzQink4KXKBpjMsID2jEocEiVn85On6Bj4/RQP5LmCY1m7u+JFIdKjcPAdIZYD9VibWr+V+skun/hp0zEiaCzBf1E450hKY5oB6TlGg+NoCJZOZWRIZYqJNWgUTgrv45WVonlZcw7dnpeplFkceDuEIyuDCOVThGurQAKP8Ayv8GY9WS/Wu/Uxb81Z2cwB/JH1+QNnZJNt</latexit> <latexit sha1_base64="pKl6zuwEtmA0k4e3YRVwGonLN7I=">AB+nicbZDLSsNAFIZP6q3W6pLN4NFqJuSiKDLohtXtYK9QBPKZDpth04mcWailNhHceNCEbc+iTvfxmbhb+MPDxn3M4Z/4g5kxpx/m2ciura+sb+c3C1vbO7p5d3G+qKJGENkjEI9kOsKcCdrQTHPajiXFYcBpKxhdTeutByoVi8SdHsfUD/FAsD4jWBuraxdvyp6lzqtTweDVDtpGuXnIozE1oGN4MSZKp37S+vF5EkpEITjpXquE6s/RLzQink4KXKBpjMsID2jEocEiVn85On6Bj4/RQP5LmCY1m7u+JFIdKjcPAdIZYD9VibWr+V+skun/hp0zEiaCzBf1E450hKY5oB6TlGg+NoCJZOZWRIZYqJNWgUTgrv45WVonlZcw7dnpeplFkceDuEIyuDCOVThGurQAKP8Ayv8GY9WS/Wu/Uxb81Z2cwB/JH1+QNnZJNt</latexit> <latexit sha1_base64="pKl6zuwEtmA0k4e3YRVwGonLN7I=">AB+nicbZDLSsNAFIZP6q3W6pLN4NFqJuSiKDLohtXtYK9QBPKZDpth04mcWailNhHceNCEbc+iTvfxmbhb+MPDxn3M4Z/4g5kxpx/m2ciura+sb+c3C1vbO7p5d3G+qKJGENkjEI9kOsKcCdrQTHPajiXFYcBpKxhdTeutByoVi8SdHsfUD/FAsD4jWBuraxdvyp6lzqtTweDVDtpGuXnIozE1oGN4MSZKp37S+vF5EkpEITjpXquE6s/RLzQink4KXKBpjMsID2jEocEiVn85On6Bj4/RQP5LmCY1m7u+JFIdKjcPAdIZYD9VibWr+V+skun/hp0zEiaCzBf1E450hKY5oB6TlGg+NoCJZOZWRIZYqJNWgUTgrv45WVonlZcw7dnpeplFkceDuEIyuDCOVThGurQAKP8Ayv8GY9WS/Wu/Uxb81Z2cwB/JH1+QNnZJNt</latexit> <latexit sha1_base64="pKl6zuwEtmA0k4e3YRVwGonLN7I=">AB+nicbZDLSsNAFIZP6q3W6pLN4NFqJuSiKDLohtXtYK9QBPKZDpth04mcWailNhHceNCEbc+iTvfxmbhb+MPDxn3M4Z/4g5kxpx/m2ciura+sb+c3C1vbO7p5d3G+qKJGENkjEI9kOsKcCdrQTHPajiXFYcBpKxhdTeutByoVi8SdHsfUD/FAsD4jWBuraxdvyp6lzqtTweDVDtpGuXnIozE1oGN4MSZKp37S+vF5EkpEITjpXquE6s/RLzQink4KXKBpjMsID2jEocEiVn85On6Bj4/RQP5LmCY1m7u+JFIdKjcPAdIZYD9VibWr+V+skun/hp0zEiaCzBf1E450hKY5oB6TlGg+NoCJZOZWRIZYqJNWgUTgrv45WVonlZcw7dnpeplFkceDuEIyuDCOVThGurQAKP8Ayv8GY9WS/Wu/Uxb81Z2cwB/JH1+QNnZJNt</latexit> Overhead of Oblivious RAM Model: Passive server, word size , client memory size O (log N ) O (1) Ω (log N ) Lower Bound: [Goldreich’87,LarsenNielsen’18] √ O ( N log N ) [Goldreich’87] O (log 3 N ) [Ostr’90/GO’96] O (log 2 N ) [GoodrichMitzenmacher’11, PathORAM’12] O (log 2 N/ log log N ) [KushilevitzLuOstrovsky’12] O (log N log log N ) PanoRAMa: [Patel,Persiano,Raykova,Yeo’18] O (log N ) Our Result:

  8. Our Main Result There exists an ORAM with O(log N) amortized overhead • Word size: log N 🎊 Asymptotically Optimal! 🎋 • Client’s memory size O(1) words • Computational Security (OWF) • Passive server • Matches [LN’18] • Balls and bins model • PRF -> Random Oracle • Large hidden constant • Statistical security • Based on hierarchical ORAM • Matches [GO’96]

Recommend

On optimal threshold defender structures of resharing-based oblivious shuffle protocols for

On optimal threshold defender structures of resharing-based oblivious shuffle protocols for

On optimal threshold defender structures of resharing-based oblivious shuffle protocols for secret-shared secure multi-party computations Jan Willemson Cybernetica Trve Theory Days October 7th-9th, 2011 Secret Shared Databases If we

710 views • 16 slides
Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik

Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik

Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute 1 Routing: choose paths from sources to destinations v 3 u 1 u v 2 2 u 3 v 1 2 Edge

567 views • 54 slides
Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magdon-Ismail Jing Xi

Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magdon-Ismail Jing Xi

Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magdon-Ismail Jing Xi Rensselaer Polytechnic Institute Outline Introduction Related Work and Our Contributions Results on Mesh Networks Future Work Outline

887 views • 52 slides
FUNCTIONALLY OBLIVIOUS (AND SUCCINCT) Edward Kmett BUILDING BETTER TOOLS Cache-Oblivious

FUNCTIONALLY OBLIVIOUS (AND SUCCINCT) Edward Kmett BUILDING BETTER TOOLS Cache-Oblivious

FUNCTIONALLY OBLIVIOUS (AND SUCCINCT) Edward Kmett BUILDING BETTER TOOLS Cache-Oblivious Algorithms Succinct Data Structures RAM MODEL Almost everything you do in Haskell assumes this model Good for ADTs, but not a realistic

673 views • 49 slides
Perfectly S Secure O Oblivious A s Algorithms s in t the M Multi-Server S Setting T-H.

Perfectly S Secure O Oblivious A s Algorithms s in t the M Multi-Server S Setting T-H.

Perfectly S Secure O Oblivious A s Algorithms s in t the M Multi-Server S Setting T-H. Hubert Chan, Jonathan Katz, Ka Kartik Nay ayak, Antigoni Polychroniadou, Elaine Shi Defini De ning ng an n Obl Oblivious us RAM Example request

812 views • 33 slides
Oblivious Routing on Geometric Networks Costas Busch, Malik Magdon-Ismail and Jing Xi {

Oblivious Routing on Geometric Networks Costas Busch, Malik Magdon-Ismail and Jing Xi {

Oblivious Routing on Geometric Networks Costas Busch, Malik Magdon-Ismail and Jing Xi { buschc,magdon,xij2 } @cs.rpi.edu July 20, 2005. Outline Oblivious Routing: Background and Our Contribution The Algorithm: Oblivious Routing with Single

709 views • 50 slides
Lower Bound! Kasper Green Larsen Jesper Buus Nielsen Oblivious RAM Introduced by Goldreich

Lower Bound! Kasper Green Larsen Jesper Buus Nielsen Oblivious RAM Introduced by Goldreich

Yes, There is an Oblivious RAM Lower Bound! Kasper Green Larsen Jesper Buus Nielsen Oblivious RAM Introduced by Goldreich and Ostrovsky in 1996 Encrypts the memory access pattern of a random-access algorithm Oblivious RAM, Model

505 views • 32 slides
Cache-Oblivious Algorithms 1 Cache-Oblivious Model 2 The Unknown Machine Algorithm Algorithm

Cache-Oblivious Algorithms 1 Cache-Oblivious Model 2 The Unknown Machine Algorithm Algorithm

Cache-Oblivious Algorithms 1 Cache-Oblivious Model 2 The Unknown Machine Algorithm Algorithm C program Java program gcc javac Object code Java bytecode linux java Execution Interpretation Can be executed on

963 views • 54 slides
Coping with the Memory Hierarchy the Cache-Oblivious Way Rolf Fagerberg University of Aarhus

Coping with the Memory Hierarchy the Cache-Oblivious Way Rolf Fagerberg University of Aarhus

Coping with the Memory Hierarchy the Cache-Oblivious Way Rolf Fagerberg University of Aarhus Imada, SDU, February 18, 2004 Overview The memory hierachy The I/O-model The cache-oblivious model Examples of cache-oblivious

1.23k views • 72 slides
PanORAMa: Oblivious RAM with Logarithmic Overhead Sarvar Patel, Giuseppe Persiano, Mariana

PanORAMa: Oblivious RAM with Logarithmic Overhead Sarvar Patel, Giuseppe Persiano, Mariana

PanORAMa: Oblivious RAM with Logarithmic Overhead Sarvar Patel, Giuseppe Persiano, Mariana Raykova, Kevin Yeo Most frequently used file Bob knows what files I am accessing Bandwidth is expensive Retrieve the whole database Oblivious RAM

1.13k views • 85 slides
A Framework for Efficient and Composable Oblivious Transfer Chris Peikert 1 Vinod Vaikuntanathan

A Framework for Efficient and Composable Oblivious Transfer Chris Peikert 1 Vinod Vaikuntanathan

A Framework for Efficient and Composable Oblivious Transfer Chris Peikert 1 Vinod Vaikuntanathan 2 Brent Waters 1 1 SRI International 2 MIT CRYPTO 2008 1 / 10 Oblivious Transfer [R81,EGL85,BCR86,C87,K88,CK88,C89,CS91,CGT95,DCP95,FMR96,BC97,. .

1.02k views • 50 slides
A Cache-Oblivious Heap Introduced by Arge et al. [1]. Based on distribution of elements

A Cache-Oblivious Heap Introduced by Arge et al. [1]. Based on distribution of elements

A Cache-Oblivious Heap Introduced by Arge et al. [1]. Based on distribution of elements References [1] L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro, Cache-oblivious priority queue and graph algorithm

520 views • 15 slides
Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data Bas Ketsman, Frank

Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data Bas Ketsman, Frank

Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data Bas Ketsman, Frank Neven Hasselt University &amp; transnational University of Limburg Outline 1. Setting and Context 2. Oblivious Broadcasting Functions 3.

1.23k views • 73 slides
Toward Computing Towards an Optimal . . . An (Almost) Optimal . . . Minor Problem an Optimal

Toward Computing Towards an Optimal . . . An (Almost) Optimal . . . Minor Problem an Optimal

Need for Unmanned . . . Need for Easily . . . Technical Details of . . . Need for an Optimal . . . Toward Computing Towards an Optimal . . . An (Almost) Optimal . . . Minor Problem an Optimal Trajectory for Solution: How to . . . What If

429 views • 20 slides
Differentially Private Oblivious RAM Sameer Wagh , Paul Cuff , Prateek Mittal July 24,

Differentially Private Oblivious RAM Sameer Wagh , Paul Cuff , Prateek Mittal July 24,

Differentially Private Oblivious RAM Sameer Wagh , Paul Cuff , Prateek Mittal July 24, 2019 Princeton University, Renaissance Technologies Introduction: Oblivious RAM Access data privately from private database. 1

898 views • 55 slides
Oblivious AQM and Nash Equilibria Dutta, Goal and Heidmann In Proceedings of the IEEE Infocom,

Oblivious AQM and Nash Equilibria Dutta, Goal and Heidmann In Proceedings of the IEEE Infocom,

Oblivious AQM and Nash Equilibria Dutta, Goal and Heidmann In Proceedings of the IEEE Infocom, pages 106-113, San Francisco, California, USA, March 2003. IEEE. Presented by ZHOU Zhen cszz COMP 670O 1-1 Oblivious AQM and Nash Equilibria

616 views • 33 slides
Cache Oblivious Sorting Gerth Stlting Brodal University of Aarhus Algorithms and Data

Cache Oblivious Sorting Gerth Stlting Brodal University of Aarhus Algorithms and Data

Cache Oblivious Sorting Gerth Stlting Brodal University of Aarhus Algorithms and Data Structures, Bertinoro, Forl` , Italy, June 22-28, 2003 1 Foundation 2 Outline of Talk Cache oblivious model Sorting problem Binary and

553 views • 33 slides
Resource Oblivious Parallel Computing Vijaya Ramachandran Department of Computer Science

Resource Oblivious Parallel Computing Vijaya Ramachandran Department of Computer Science

Resource Oblivious Parallel Computing Vijaya Ramachandran Department of Computer Science University of Texas at Austin Joint work with Richard Cole Reference. R. Cole, V. Ramachandran, Efficient Resource Oblivious Algorithms for

753 views • 58 slides
ON THE FEASIBILITY OF EXTENDING OBLIVIOUS TRANSFER Yehuda Lindell Yehuda Lindell Hila Zarosim

ON THE FEASIBILITY OF EXTENDING OBLIVIOUS TRANSFER Yehuda Lindell Yehuda Lindell Hila Zarosim

ON THE FEASIBILITY OF EXTENDING OBLIVIOUS TRANSFER Yehuda Lindell Yehuda Lindell Hila Zarosim Hila Zarosim TCC 2013 Obli i Oblivious Transfer T f The other message message remains secret to the the receiver Obli i Oblivious

757 views • 38 slides
Identity Testing &amp; Lower Bounds for Read- k Oblivious ABPs Ben Lee Volk Joint with Matthew

Identity Testing &amp; Lower Bounds for Read- k Oblivious ABPs Ben Lee Volk Joint with Matthew

Identity Testing &amp; Lower Bounds for Read- k Oblivious ABPs Ben Lee Volk Joint with Matthew Anderson Michael A. Forbes Ramprasad Saptharishi Amir Shpilka Read-Once Oblivious ABPs x 2 + 1 x 9 1 2 x 7 2 x 9 + 2 x 7 3 x 2 .

1.18k views • 89 slides
Cache-Oblivious Algorithms Paper Reading Group Matteo Frigo Charles E. Leiserson Harald Prokop

Cache-Oblivious Algorithms Paper Reading Group Matteo Frigo Charles E. Leiserson Harald Prokop

Cache-Oblivious Algorithms Paper Reading Group Matteo Frigo Charles E. Leiserson Harald Prokop Sridhar Ramachandran Presents: Maksym Planeta 03.09.2015 Table of Contents Introduction Cache-oblivious algorithms Matrix multiplication

1.33k views • 31 slides
Oblivious Signature-Based Envelope scheme (OSBE) Presented By: Khaled Rabieh Supervisor: Dr.

Oblivious Signature-Based Envelope scheme (OSBE) Presented By: Khaled Rabieh Supervisor: Dr.

Oblivious Signature-Based Envelope scheme (OSBE) Presented By: Khaled Rabieh Supervisor: Dr. Mohamed Mahmoud Outline - What is Oblivious Signature-Based Envelope (OSBE)? - Applications - cryptosystem - Analysis 2 Problem Formulation -

339 views • 14 slides
Oblivious Neural Network Predictions via MiniONN Transformations Presented by: Sherif

Oblivious Neural Network Predictions via MiniONN Transformations Presented by: Sherif

Oblivious Neural Network Predictions via MiniONN Transformations Presented by: Sherif Abdelfattah Liu, J., Juuti, M., Lu, Y., &amp; Asokan, N. (2017, October). Oblivious neural network predictions via minionn transformations. In Proceedings of

523 views • 18 slides
Generic Construction of UC-Secure Oblivious Transfer O. Blazy , C.Chevalier O. Blazy (Xlim)

Generic Construction of UC-Secure Oblivious Transfer O. Blazy , C.Chevalier O. Blazy (Xlim)

Generic Construction of UC-Secure Oblivious Transfer O. Blazy , C.Chevalier O. Blazy (Xlim) Generic OT 1 / 20 Global Framework 1 Cryptographic Tools 2 1-out-of- t Oblivious Transfer 3 Instantiation 4 Conclusion 5 O. Blazy (Xlim)

852 views • 45 slides

More recommend