[PDF] Top 20 SCORAM: Oblivious RAM for Secure Computation

... In this section, we show the performance of scoram when used in practical applications. We assume Alice holds a sorted array and Bob holds queries. They would like to re- peatedly search for some element over the ... See full document

... be secure, it is impera- tive that each block in a bucket should be read at most once—a key idea also adopted by Goldreich and Ostro- vsky in their early ORAM constructions ... See full document

... In this work, we give the first solution providing proofs of retrievability for dynamic storage, where the client can perform arbitrary reads/writes on any location within her data by running an efficient protocol with ... See full document

... of secure two-party computation proposed by Yao [16] is secure only in semi- honest model, the cut-and-choose technique used for constructing secure protocols in the presence of malicious ... See full document

... of Oblivious RAM (ORAM) considers the question of how to enable a client to outsource its database to an untrusted server and to query it subsequently without any privacy leakage related to the queries and ... See full document

... standard RAM, ex- cept that computation is free of charge and we only pay for memory ...the oblivious cell probe model, formally in Section ... See full document

... An Oblivious RAM (ORAM), first introduced by Goldreich and Ostrovsky [Gol87, Ost90, GO96], is a scheme that allows a client to read and write to his data stored on untrusted storage, while entirely hiding ... See full document

... Complexity analysis: The computational overhead of an eviction is composed of the following operations: The whole procedure is performed for each level, in a tree of height h = O( log log log N N ). Popping an item (step ... See full document

... Oblivious RAM has been a perennial research topic since it was first introduced by Goldreich ...controlled RAM to be effectively ...evaluation, secure multi-party compu- tation, and ... See full document

... multiparty computation (MPC) protocols are ...as oblivious transfer (OT) and commitment schemes that are adaptively-secure as building ...This computation overhead translates to ...adaptively ... See full document

... and SCORAM each stores at least 5N dummy blocks at the server, and incurs a communication cost of O(log N · B) blocks per query, with a client-side storage of O(log N ) · ω(1) blocks, where ω(1) is a security ... See full document

... a secure method to distribute the work done in each shuffle step among multiple compu- tational units without compromising the original secu- rity ...total computation work is the same as in the original ... See full document

... trusted secure cloud processor that is attached to untrusted external memory such as disk, DRAM or ...most secure processor proposals [15], [7], [22], [19], [6] have adopted Path ORAM due to its algorithmic ... See full document

... For more than three decades, the biggest open question in this line of work is regarding the optimal overhead of ORAM. Goldreich and Ostrovsky’s original work [29,31] showed a construction with O(log 3 N ) blowup in ... See full document

... chosen RAM programs that execute and modify the stored database ...laconic oblivious transfer (Cho et ...garbled RAM constructions were only known using indistinguishability obfuscation or in random ... See full document

... simple computation such as XOR and any semantically secure encryption scheme with small ciphertext blowup? A partial result in this direction comes from Burst ORAM [9]: simple computation on ... See full document

... An ORAM scheme hides the sequence of logical commands from an untrusted (honest-but-curious) server, who observes the actual sequence of accesses. The actual values written to the server can be hidden using ... See full document

... Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky [18,19], allows a trusted CPU (or a trusted computational node) to obliviously access untrusted memory (or storage) during computa- tion, such ... See full document

... yields secure offline ORAM with sub-logarithmic ...the RAM model one can obtain near-linear O(n log log n) complexity sorting algorithms [AHNR95, Han04]; it is not known whether these algorithms can lead to ... See full document

... 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the mali- cious ...to secure biometric ... See full document