880 Hits in 1.4 sec

Scaling ORAM for Secure Computation

Jack Doerner, Abhi Shelat
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
We design and implement a Distributed Oblivious Random Access Memory (DORAM) data structure that is optimized for use in twoparty secure computation protocols.  ...  This significantly reduces the amount of secure computation required to implement an ORAM access, albeit at the cost of O (n) efficient local memory operations.  ...  ACKNOWLEDGMENT The authors would like to thank the authors of the Square-root ORAM paper [55] , and especially Samee Zahur, for his insight and technical expertise.  ... 
doi:10.1145/3133956.3133967 dblp:conf/ccs/DoernerS17 fatcat:wg4kz5u2xzaylhbb6rn34vo6we

Secure Stable Matching at Scale

Jack Doerner, David Evans, abhi shelat
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
However, stable matching algorithms have previously been considered infeasible for execution in a secure multi-party context on non-trivial inputs because they are computationally intensive and involve  ...  Secure multi-party computation offers the possibility of private matching processes that do not rely on any common trusted third party.  ...  Acknowledgments The authors thank Samee Zahur for insightful conversations about this work and assistance with Obliv-C and ORAM, and Elaine Shi for constructive comments and advice.  ... 
doi:10.1145/2976749.2978373 dblp:conf/ccs/DoernerES16 fatcat:4wgv35kgwrhg5ob6ognyarchf4


Xiao Shaun Wang, Yan Huang, T-H. Hubert Chan, Abhi Shelat, Elaine Shi
2014 Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14  
We then present scoram, a heuristic compact ORAM design optimized for secure computation protocols.  ...  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 would like to thank Marten van Dijk, Dov Gordon, Jonathan Katz, Kartik Nayak, and Saba Eskandarian for numerous helpful discussions.  ... 
doi:10.1145/2660267.2660365 dblp:conf/ccs/WangHCSS14 fatcat:mrefrwxeg5ekznre2sz7qanyy4

Trace oblivious computation

Chang Liu
2015 Companion Proceedings of the 2015 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Software for Humanity - SPLASH Companion 2015  
My study on the secure computation application shows that using our compiler, one PhD student can develop an oblivious algorithm in one day which took a research group of 5 researchers 4 months to develop  ...  On the one hand, a cryptographic protocol called Oblivious RAM (ORAM) has been developed as a generic tool to achieve obliviousness, while incurring an overhead.  ...  , to secure computation.  ... 
doi:10.1145/2814189.2814200 dblp:conf/oopsla/Liu15 fatcat:xny5l36slvcpledngq236eb3u4

Multi-cloud oblivious storage

Emil Stefanov, Elaine Shi
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
Our approach makes ORAM practical for bandwidth-constrained clients such as home or mobile Internet connections.  ...  We present a 2-cloud oblivious storage (ORAM) system that achieves 2.6X bandwidth cost between the client and the cloud.  ...  We would like to thank Matthew Green for helpful discussions and the anonymous reviewers for their insightful feedback.  ... 
doi:10.1145/2508859.2516673 dblp:conf/ccs/StefanovS13 fatcat:e4jbexipmndn7hr2y2h3admgcy

ObliviStore: High Performance Oblivious Cloud Storage

E. Stefanov, E. Shi
2013 2013 IEEE Symposium on Security and Privacy  
We propose various practical optimizations which are key to achieving high performance, as well as techniques for a data center to dynamically scale up a distributed ORAM.  ...  We design and build ObliviStore, a high performance, distributed ORAM-based cloud data store secure in the malicious model.  ...  ACKNOWLEDGMENTS We gratefully acknowledge Dawn Song and Bobby Bhattacharjee for their kind support, Dustin Schnaitman from Amazon for helping us acquire resources, and Jonathan Dautrich for helping clarify  ... 
doi:10.1109/sp.2013.25 dblp:conf/sp/StefanovS13 fatcat:eac4fgxvnzhhhgywanz5y42z2m

Secure two-party computation in sublinear (amortized) time

S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Fernando Krell, Tal Malkin, Mariana Raykova, Yevgeniy Vahlis
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
Our protocol applies generic secure two-party computation on top of oblivious RAM (ORAM).  ...  Traditional approaches to generic secure computation begin by representing the function f being computed as a circuit.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon.  ... 
doi:10.1145/2382196.2382251 dblp:conf/ccs/GordonKKKM0V12 fatcat:jb3gri5gqrd6jfl6wuzq2t3dai

Etoram: A More Efficient ORAM for Secure Computation

Zhihong Chen, Bo Zhao, Hai Lin, Lin Chen
2020 IEEE Open Journal of the Computer Society  
When scaling a distributed ORAM to a two-party secure computation, the overhead is dominated by the number of pseudo-random generator (PRG) calls in generation and evaluation of a distributed point function  ...  Technically, we first extend the optimization of Function Secret Sharing (FSS), early termination for functions with small output groups, to the context of ORAM for secure computation.  ...  Substantial improvements on the efficiency of ORAM while scaling to secure computation have been carried out.  ... 
doi:10.1109/ojcs.2020.3032020 fatcat:y7bnyyeafzgkdopauoxxyekjqy

Flat ORAM: A Simplified Write-Only Oblivious RAM Construction for Secure Processors [article]

Syed Kamran Haider, Marten van Dijk
2017 arXiv   pre-print
Our simulation results show that, on average, Flat ORAM only incurs a moderate slowdown of 3× over the insecure DRAM for memory intensive benchmarks among Splash2 and 1.6× for SPEC06.  ...  For such weaker adversaries, a fully functional ORAM turns out to be an overkill causing unnecessary overheads.  ...  Path ORAM Path ORAM [37] is currently the most e cient and well studied ORAM implementation for secure processors.  ... 
arXiv:1611.01571v4 fatcat:ljfj4crpnfgllig3hhjdybzkiq

Flat ORAM: A Simplified Write-Only Oblivious RAM Construction for Secure Processors

Syed Haider, Marten van Dijk
2019 Cryptography  
For such weaker adversaries, a fully functional ORAM turns out to be an overkill, causing unnecessary overheads.  ...  HIVE suffers from performance bottlenecks while managing the memory occupancy information vital for correctness of the protocol.  ...  Path ORAM Path ORAM [24] is currently the most efficient and well studied ORAM implementation for secure processors.  ... 
doi:10.3390/cryptography3010010 fatcat:d2avcygye5aa7jh4fpivjecjkm

Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs

Christopher W. Fletchery, Ling Ren, Xiangyao Yu, Marten Van Dijk, Omer Khan, Srinivas Devadas
2014 2014 IEEE 20th International Symposium on High Performance Computer Architecture (HPCA)  
The secure processor is allowed to dynamically optimize ORAM access rate for power/performance, subject to the constraint that the leakage limit is not violated.  ...  Since secure processors make ORAM accesses on last-level cache misses, ORAM access timing strongly correlates to program access pattern (e.g., locality).  ...  Intuitively, the lg scale gives memory-bound (ORAM-sensitive) workloads more rates to choose from; whereas 32768 is a suitable rate for all compute bound workloads.  ... 
doi:10.1109/hpca.2014.6835932 dblp:conf/hpca/FletcherRYDKD14 fatcat:kr7ult7xdbfrlolpdbdbwmgpce

Automating Efficient RAM-Model Secure Computation

Chang Liu, Yan Huang, Elaine Shi, Jonathan Katz, Michael Hicks
2014 2014 IEEE Symposium on Security and Privacy  
Here, we describe the first automated approach for RAM-model secure computation in the semihonest model.  ...  We define an intermediate representation called SCVM and a corresponding type system suited for RAM-model secure computation.  ...  We also thank the anonymous reviewers and our shepherd for their insightful feedback and comments.  ... 
doi:10.1109/sp.2014.46 dblp:conf/sp/LiuHSKH14 fatcat:ltxwmwhmabgdtd5g3dvtbvw3jm

Integrity verification for path Oblivious-RAM

Ling Ren, Christopher W. Fletcher, Xiangyao Yu, Marten van Dijk, Srinivas Devadas
2013 2013 IEEE High Performance Extreme Computing Conference (HPEC)  
In this paper, we propose an efficient integrity verification layer for Path ORAM, which only imposes 17% latency overhead.  ...  We also show that integrity verification is vital to maintaining privacy for recursive Path ORAMs under active adversaries.  ...  An interesting application of ORAM is to improve the security level of secure processors in cloud computing.  ... 
doi:10.1109/hpec.2013.6670339 dblp:conf/hpec/RenFYDD13 fatcat:x3ydkroruzhftjejuva4oaatsi

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM [chapter]

Srinivas Devadas, Marten van Dijk, Christopher W. Fletcher, Ling Ren, Elaine Shi, Daniel Wichs
2015 Lecture Notes in Computer Science  
Therefore, it is natural to extend the ORAM model to allow for server computation, 1 and to distinguish between the amount of computation performed by the server and the amount of communication with the  ...  To the best of our knowledge, Onion ORAM is the first concrete instantiation of a constant bandwidth blowup ORAM under standard assumptions (even for the semi-honest setting).  ...  Acknowledgements We thank Vinod Vaikuntanathan for helpful discussion on this work.  ... 
doi:10.1007/978-3-662-49099-0_6 fatcat:vlbwtfqrc5foheq5gtxsyskakq

3PC ORAM with Low Latency, Low Bandwidth, and Fast Batch Retrieval [chapter]

Stanislaw Jarecki, Boyang Wei
2018 Lecture Notes in Computer Science  
MPC ORAM makes such computation feasible because it generalizes secure computation from circuits to RAM programs: All RAM program instruction can be implemented using circuit-based MPC, since they involves  ...  MPC ORAM enables secure computation of any RAM program on large data held by different entities, e.g. MPC processing of database queries on a secret-shared database.  ...  However, both of these 2PC ORAM's use O( √ n) bandwidth, and [12] also uses O(n) local computation, which makes them not scale well for large n's. 4 Restricting the comparison to poly(log n) MPC ORAM  ... 
doi:10.1007/978-3-319-93387-0_19 fatcat:siegnajrnradvkdalrpqoqn5py
« Previous Showing results 1 — 15 out of 880 results