Back to Results
First PageMeta Content
Fibonacci heap / Scapegoat tree / Amortized analysis / Analysis of algorithms / Computer science


Oblivious RAM with O((log N )3 ) Worst-Case Cost Elaine Shi1 , T-H. Hubert Chan2 , Emil Stefanov3 , and Mingfei Li2 1 2
Add to Reading List

Document Date: 2011-09-09 09:55:48


Open Document

File Size: 376,76 KB

Share Result on Facebook

Company

Goodrich / Mitzenmacher / /

Facility

PARC The University of Hong Kong / /

IndustryTerm

real-world applications / online full version / storage applications / oblivious protocol / hierarchical solution / remote untrusted server / interactive protocols / online full technical report / binary search tree / storage outsourcing applications / seminal hierarchical solution / /

Organization

University of Hong Kong / UC Berkeley / /

Technology

encryption / oblivious protocol / RAM / simulation / two encryptions / interactive protocol / 2.4 Encryption / /

SocialTag