Open AccessPosted Content
SCORAM: Oblivious RAM for Secure Computation.
Reads0
Chats0
TLDR
In this article, a heuristic compact ORAM design optimized for secure computation protocols is presented, which is almost 10x smaller in circuit size and also faster than all other designs tested for realistic settings (i.e., memory sizes between 4MB and 2GB).Abstract:
Oblivious RAMs (ORAMs) have traditionally been measured by their bandwidth overhead and client storage. We observe that when using ORAMs to build secure computation protocols for RAM programs, the size of the ORAM circuits is more relevant to the performance. We therefore embark on a study of the circuit-complexity of several recently proposed ORAM constructions. Our careful implementation and experiments show that asymptotic analysis is not indicative of the true performance of ORAM in secure computation protocols with practical data sizes. We then present scoram, a heuristic compact ORAM design optimized for secure computation protocols. Our new design is almost 10x smaller in circuit size and also faster than all other designs we have tested for realistic settings (i.e., memory sizes between 4MB and 2GB, constrained by 2−80 failure probability). scoram makes it feasible to perform secure computations on gigabyte-sized data sets.read more
Citations
More filters
Proceedings ArticleDOI
ObliVM: A Programming Framework for Secure Computation
TL;DR: This work develops various showcase applications such as data mining, streaming algorithms, graph algorithms, genomic data analysis, and data structures, and demonstrates the scalability of ObliVM to bigger data sizes.
Book
A Pragmatic Introduction to Secure Multi-Party Computation
TL;DR: This monograph provides an introduction to multi-party computation for practitioners interested in building privacy-preserving applications and researchers who want to work in the area and provides a starting point for building applications using MPC and for developing MPC protocols, implementations, tools, and applications.
Posted Content
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound.
TL;DR: The proposed new tree-based ORAM scheme, Circuit ORAM, achieves (almost) optimal circuit size both in theory and in practice for realistic choices of block sizes and is an ideal candidate for secure multi-party computation applications.
Book ChapterDOI
Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
TL;DR: The Onion ORAM is the first concrete instantiation of a constant bandwidth blowup ORAM under standard assumptions, and proposes novel techniques to achieve security against a malicious server, without resorting to expensive and non-standard techniques such as SNARKs.
Posted Content
Obliv-C: A Language for Extensible Data-Oblivious Computation.
Samee Zahur,David Evans +1 more
TL;DR: In this paper, the authors introduce a new language that allows application developers to program secure computations without being experts in cryptography, while enabling programmers to create abstractions such as oblivious RAM and width-limited integers, or even new protocols without needing to modify the compiler.
References
More filters
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Proceedings ArticleDOI
How to generate and exchange secrets
TL;DR: A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
Proceedings Article
Fairplay—a secure two-party computation system
TL;DR: Fairplay is introduced, a full-fledged system that implements generic secure function evaluation (SFE) and provides a test-bed of ideas and enhancements concerning SFE, whether by replacing parts of it, or by integrating with it.
Proceedings ArticleDOI
Path ORAM: an extremely simple oblivious RAM protocol
Emil Stefanov,Marten van Dijk,Elaine Shi,Christopher W. Fletcher,Ling Ren,Xiangyao Yu,Srinivas Devadas +6 more
TL;DR: Path ORAM as discussed by the authors is the most practical oblivious RAM protocol for small client storage known to date, which requires log 2 N / log X bandwidth overhead for block size B = X log N. Path ORAM has been adopted in the design of secure processors since its proposal.
Proceedings Article
Faster secure two-party computation using garbled circuits
TL;DR: This work demonstrates several techniques for improving the running time and memory requirements of the garbled-circuit technique, resulting in an implementation of generic secure two-party computation that is significantly faster than any previously reported while also scaling to arbitrarily large circuits.