More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs

Pattern of data access is independent of data values. • Server holds n items, encrypted. • Client has W = O(log n) working storage. • No Random-Oracles. • Best DO RAM simulation: O(log3 n) overhead [2]. • Using compressed-scanning: only O(log n) overhead. Compressed-Scanning In t rounds: • Read batch of Bin < W items from input. Each item of input read exactly once. Permutation π hides access pattern. • Simple computation in private memory. • Write batch of Bout items to output. Possibly some dummy items. • Sort output data-obliviously (e.g. using a sorting network). • Use output stream as input for next round. Input Array