| Document Date: 2014-10-29 22:55:19
Open Document File Size: 929,09 KBShare Result on Facebook
City Technique Pointer / Scottsdale / Pointer / / Company AES / Google / Computer-Communication Networks / Ford / / Country United States / / Currency USD / / / Facility Building Block / / IndustryTerm oblivious algorithms / secure processor / balanced search trees / online query / dynamic access algorithms / residual network / online version / shortest path algorithm / cloud storage applications / memory allocator algorithm / polynomial-time algorithm / online full version / breadth-first search / oblivious memory allocator algorithm / maximum flow algorithm / computer science applications / Graph algorithms / memory management algorithms / oblivious binary search tree / secure processors / secure computation protocol / online part / binary search technique / binary search / memory management algorithm / present oblivious graph algorithms / offline processing time / logical binary search tree / tamper-resistant secure processors / inefficient solution / binary search tree / started investigating type systems / online cost / depth-first-search / / MarketIndex Set 30 / / Organization Defense Advanced Research Projects Agency / National Science Foundation / US government / UC Berkeley / ODS SC / / Person Xiao Shaun / Jonathan Katz / / Position author / / Product Path ORAM / / ProvinceOrState South Carolina / Arizona / / Technology memory management algorithm / RAM / shortest path algorithm / The algorithm / secure computation protocol / operating system / detailed algorithms / metadata Oblivious Dynamic Data Allocation Secure Processor Program ORAM Protocol Data Memory Oblivious Memory Allocator ODS Protocol / 1.1 Related Work Oblivious algorithms / encryption / Graph algorithms / Cryptography / maximum flow algorithm / ciphering algorithms / secure processor / oblivious memory allocator algorithm / memory allocator algorithm / present oblivious graph algorithms / simulation / tamper-resistant secure processors / existing memory management algorithms / strongly polynomial-time algorithm / dynamic access algorithms / / URL http /
SocialTag |
Oblivious Data Structures∗ Xiao Shaun Wang1 , Kartik Nayak1 , Chang Liu1 , T-H. Hubert Chan2 , Elaine Shi1 , Emil Stefanov3 , and Yan Huang4 1 UMD