| Document Date: 2014-12-15 19:27:12
Open Document File Size: 2,48 MBShare Result on Facebook
Company Ring ORAM / / / Facility University of Connecticut / College Park / University of Maryland / Massachusetts Institute of Technology / University of California / / IndustryTerm secure processor / constant factor online bandwidth / secure processors / remote server / access protocol / post-processing algorithm / enterprise file server / Online Bandwidth Overall Bandwidth Client Storage Large client storage / file server / postL processing / post-processing / oblivious file server / greedy post-processing algorithm / remote secure processor / trusted computing base / insecure systems / cloud computing / online bandwidth / online and offline bandwidth / online cost / / Organization University of Connecticut / University of California / Berkeley / Massachusetts Institute of Technology / University of Maryland / College Park / / Person ORAM P ROTOCOL / Christopher W. Fletcher / Albert Kwon / Ling Ren / Emil Stefanov / Srinivas Devadas / Elaine Shi / / Product ReadPath / / ProgrammingLanguage L / / ProvinceOrState ORAMZ / / Technology encryption / ORAM protocol / greedy post-processing algorithm / RAM / access protocol / Memory bus Secure processor / ORAM ORAM Client data Position map Untrusted cloud Cloud processors / bandwidthefficient ORAM protocol / secure processor / post-processing algorithm / ORAM algorithm / remote secure processor / Caching / EvictPath algorithms / random access / simulation / ptrs Encryption / Eviction Operations Algorithm / clear Algorithm / /
SocialTag |
Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM Ling Ren† , Christopher W. Fletcher† , Albert Kwon† , Emil Stefanov◦ , Elaine Shi ∗