Asymptotically Tight Bounds for Composing ORAM with PIR
暂无分享,去创建一个
Kartik Nayak | Benny Pinkas | Ittai Abraham | Ling Ren | Christopher W. Fletcher | Kartik Nayak | Benny Pinkas | Ling Ren | Ittai Abraham
[1] Travis Mayberry,et al. Efficient Private File Retrieval by Combining ORAM and PIR , 2014, NDSS.
[2] Sanjam Garg,et al. TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption , 2015, IACR Cryptol. ePrint Arch..
[3] Jinsheng Zhang,et al. MSKT-ORAM: A Constant Bandwidth ORAM without Homomorphic Encryption , 2016, IACR Cryptol. ePrint Arch..
[4] Tarik Moataz,et al. Constant Communication ORAM without Encryption , 2015, IACR Cryptol. ePrint Arch..
[5] Kartik Nayak,et al. Oblivious Data Structures , 2014, IACR Cryptol. ePrint Arch..
[6] Elaine Shi,et al. Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound , 2015, IACR Cryptol. ePrint Arch..
[7] Helger Lipmaa,et al. An Oblivious Transfer Protocol with Log-Squared Communication , 2005, ISC.
[8] Eyal Kushilevitz,et al. Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[9] Ashay Rane,et al. Raccoon: Closing Digital Side-Channels through Obfuscated Execution , 2015, USENIX Security Symposium.
[10] Elaine Shi,et al. Verifiable Oblivious Storage , 2014, Public Key Cryptography.
[11] Abhi Shelat,et al. SCORAM: Oblivious RAM for Secure Computation , 2014, IACR Cryptol. ePrint Arch..
[12] Kai-Min Chung,et al. Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead , 2013, ArXiv.
[13] Elaine Shi,et al. Towards Practical Oblivious RAM , 2011, NDSS.
[14] Craig Gentry,et al. Optimizing ORAM and Using It Efficiently for Secure Computation , 2013, Privacy Enhancing Technologies.
[15] Benny Pinkas,et al. Oblivious RAM Revisited , 2010, CRYPTO.
[16] Srinivas Devadas,et al. Integrity verification for path Oblivious-RAM , 2013, 2013 IEEE High Performance Extreme Computing Conference (HPEC).
[17] Elaine Shi,et al. Automating Efficient RAM-Model Secure Computation , 2014, 2014 IEEE Symposium on Security and Privacy.
[18] Srinivas Devadas,et al. Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM , 2015 .
[19] Michael T. Goodrich,et al. Privacy-preserving group data access via stateless oblivious RAM simulation , 2011, SODA.
[20] Kai-Min Chung,et al. Oblivious Parallel RAM and Applications , 2016, TCC.
[21] Elaine Shi,et al. ObliviStore: High Performance Oblivious Cloud Storage , 2013, 2013 IEEE Symposium on Security and Privacy.
[22] Peter Williams,et al. PrivateFS: a parallel oblivious file system , 2012, CCS.
[23] Kartik Nayak,et al. ObliVM: A Programming Framework for Secure Computation , 2015, 2015 IEEE Symposium on Security and Privacy.
[24] Rafail Ostrovsky,et al. On the (in)security of hash-based oblivious RAM and a new balancing scheme , 2012, SODA.
[25] Zeev Dvir,et al. 2-Server PIR with Sub-Polynomial Communication , 2014, STOC.
[26] Oded Goldreich,et al. Towards a theory of software protection and simulation by oblivious RAMs , 1987, STOC.
[27] Srinivas Devadas,et al. Design space exploration and optimization of path oblivious RAM in secure processors , 2013, ISCA.
[28] Elaine Shi,et al. PHANTOM: practical oblivious computation in a secure processor , 2013, CCS.
[29] Srinivas Devadas,et al. A secure processor architecture for encrypted computation on untrusted programs , 2012, STC '12.
[30] Tarik Moataz,et al. CHf-ORAM : A Constant Communication ORAM without Homomorphic Encryption , 2016 .
[31] Elaine Shi,et al. Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns , 2014, USENIX Security Symposium.
[32] Yan Huang,et al. Practicing Oblivious Access on Cloud Storage: the Gap, the Fallacy, and the New Way Forward , 2015, CCS.
[33] John C. Mitchell,et al. Data-Oblivious Data Structures , 2014, STACS.
[34] Miklós Ajtai,et al. Oblivious RAMs without cryptogrpahic assumptions , 2010, STOC '10.
[35] Elaine Shi,et al. Constants Count: Practical Improvements to Oblivious RAM , 2015, USENIX Security Symposium.
[36] Elaine Shi,et al. Oblivious RAM with O((logN)3) Worst-Case Cost , 2011, ASIACRYPT.
[37] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[38] Jinsheng Zhang,et al. KT-ORAM: A Bandwidth-efficient ORAM Built on K-ary Tree of PIR Nodes , 2014, IACR Cryptol. ePrint Arch..
[39] Ivan Damgård,et al. Perfectly Secure Oblivious RAM Without Random Oracles , 2011, IACR Cryptol. ePrint Arch..
[40] Elaine Shi,et al. GhostRider: A Hardware-Software System for Memory Trace Oblivious Computation , 2015, ASPLOS.
[41] Craig Gentry,et al. Private Database Access with HE-over-ORAM Architecture , 2015, ACNS.
[42] Elaine Shi,et al. Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM , 2015, IACR Cryptol. ePrint Arch..
[43] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[44] Stefano Tessaro,et al. Oblivious Parallel RAM: Improved Efficiency and Generic Constructions , 2016, TCC.
[45] Michael T. Goodrich,et al. Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation , 2010, ICALP.
[46] Jonathan Katz,et al. Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation , 2016, 2016 IEEE Symposium on Security and Privacy (SP).
[47] Amr El Abbadi,et al. TaoStore: Overcoming Asynchronicity in Oblivious Data Storage , 2016, 2016 IEEE Symposium on Security and Privacy (SP).
[48] Moni Naor,et al. Is There an Oblivious RAM Lower Bound? , 2016, ITCS.
[49] Kai-Min Chung,et al. Statistically-secure ORAM with Õ(log2 n) Overhead , 2014, ASIACRYPT.
[50] Elaine Shi,et al. Multi-cloud oblivious storage , 2013, CCS.
[51] Joshua Schiffman,et al. Shroud: ensuring private access to large-scale data in the data center , 2013, FAST.
[52] Srinivas Devadas,et al. A Low-Latency, Low-Area Hardware Oblivious RAM Controller , 2015, 2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines.
[53] Peter Williams,et al. Building castles out of mud: practical access pattern privacy and correctness on untrusted storage , 2008, CCS.
[54] Marcel Keller,et al. Efficient, Oblivious Data Structures for MPC , 2014, IACR Cryptol. ePrint Arch..
[55] Craig Gentry,et al. Single-Database Private Information Retrieval with Constant Communication Rate , 2005, ICALP.
[56] Rafail Ostrovsky,et al. Private Information Storage , 1996, IACR Cryptol. ePrint Arch..
[57] Elaine Shi,et al. Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM , 2016, TCC.
[58] Ling Ren,et al. Path ORAM , 2012, J. ACM.
[59] Rafail Ostrovsky,et al. How to Garble RAM Programs , 2013, EUROCRYPT.
[60] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[61] Tarik Moataz,et al. Constant Communication ORAM with Small Blocksize , 2015, CCS.
[62] Rafail Ostrovsky,et al. Distributed Oblivious RAM for Secure Two-Party Computation , 2013, TCC.