Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
暂无分享,去创建一个
Elaine Shi | Srinivas Devadas | Marten van Dijk | Daniel Wichs | Ling Ren | Christopher W. Fletcher | E. Shi | S. Devadas | Ling Ren | Daniel Wichs | D. Wichs
[1] Helger Lipmaa,et al. An Oblivious Transfer Protocol with Log-Squared Communication , 2005, ISC.
[2] Tarik Moataz,et al. Constant Communication Oblivious RAM , 2015, IACR Cryptol. ePrint Arch..
[3] Marcel Keller,et al. Efficient, Oblivious Data Structures for MPC , 2014, IACR Cryptol. ePrint Arch..
[4] 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.
[5] Srinivas Devadas,et al. A secure processor architecture for encrypted computation on untrusted programs , 2012, STC '12.
[6] Manuel Blum,et al. Checking the correctness of memories , 2005, Algorithmica.
[7] Elaine Shi,et al. Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns , 2014, USENIX Security Symposium.
[8] Oded Goldreich,et al. Towards a Theory of Software Protection , 1986, CRYPTO.
[9] Philipp Slusallek,et al. Specialization through dynamic staging , 2015 .
[10] Srinivas Devadas,et al. Design space exploration and optimization of path oblivious RAM in secure processors , 2013, ISCA.
[11] Elaine Shi,et al. Constants Count: Practical Improvements to Oblivious RAM , 2015, USENIX Security Symposium.
[12] Vinod Vaikuntanathan,et al. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption , 2012, STOC '12.
[13] Peter Williams,et al. PrivateFS: a parallel oblivious file system , 2012, CCS.
[14] Rafail Ostrovsky,et al. On the (in)security of hash-based oblivious RAM and a new balancing scheme , 2012, SODA.
[15] Kartik Nayak,et al. Oblivious Data Structures , 2014, IACR Cryptol. ePrint Arch..
[16] Anat Paskin-Cherniavsky,et al. Evaluating Branching Programs on Encrypted Data , 2007, TCC.
[17] Srinivas Devadas,et al. Generalized external interaction with tamper-resistant hardware with bounded information leakage , 2013, CCSW.
[18] Elaine Shi,et al. Path ORAM: an extremely simple oblivious RAM protocol , 2012, CCS.
[19] Joshua Schiffman,et al. Shroud: ensuring private access to large-scale data in the data center , 2013, FAST.
[20] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[21] Craig Gentry,et al. Private Database Access with HE-over-ORAM Architecture , 2015, ACNS.
[22] Craig Gentry,et al. Outsourcing Private RAM Computation , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[23] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[24] Craig Gentry,et al. Separating succinct non-interactive arguments from all falsifiable assumptions , 2011, STOC '11.
[25] Jinsheng Zhang,et al. KT-ORAM: A Bandwidth-efficient ORAM Built on K-ary Tree of PIR Nodes , 2014, IACR Cryptol. ePrint Arch..
[26] Rafail Ostrovsky,et al. Garbled RAM Revisited , 2014, EUROCRYPT.
[27] Elaine Shi,et al. Authenticated data structures, generically , 2014, POPL.
[28] Elaine Shi,et al. Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound , 2015, IACR Cryptol. ePrint Arch..
[29] Rafail Ostrovsky,et al. How to Garble RAM Programs , 2013, EUROCRYPT.
[30] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[31] Ralph C. Merkle,et al. Protocols for Public Key Cryptosystems , 1980, 1980 IEEE Symposium on Security and Privacy.
[32] Craig Gentry,et al. (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.
[33] Elaine Shi,et al. Verifiable Oblivious Storage , 2014, Public Key Cryptography.
[34] Abhi Shelat,et al. SCORAM: Oblivious RAM for Secure Computation , 2014, IACR Cryptol. ePrint Arch..
[35] Vinod Vaikuntanathan,et al. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.
[36] Craig Gentry,et al. Optimizing ORAM and Using It Efficiently for Secure Computation , 2013, Privacy Enhancing Technologies.
[37] Srinivas Devadas,et al. Integrity verification for path Oblivious-RAM , 2013, 2013 IEEE High Performance Extreme Computing Conference (HPEC).
[38] Srinivas Devadas,et al. Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM , 2015 .
[39] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[40] Shai Halevi,et al. Bootstrapping for HElib , 2015, EUROCRYPT.
[41] Chinya V. Ravishankar,et al. Combining ORAM with PIR to Minimize Bandwidth Costs , 2015, CODASPY.
[42] Elaine Shi,et al. Towards Practical Oblivious RAM , 2011, NDSS.
[43] Elaine Shi,et al. Automating Efficient RAM-Model Secure Computation , 2014, 2014 IEEE Symposium on Security and Privacy.
[44] Peter Williams,et al. Single round access privacy on outsourced storage , 2012, CCS '12.
[45] Michael T. Goodrich,et al. Privacy-preserving group data access via stateless oblivious RAM simulation , 2011, SODA.
[46] Craig Gentry,et al. Better Bootstrapping in Fully Homomorphic Encryption , 2012, Public Key Cryptography.
[47] Elaine Shi,et al. ObliviStore: High Performance Oblivious Cloud Storage , 2013, 2013 IEEE Symposium on Security and Privacy.
[48] Ivan Damgård,et al. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.
[49] Elaine Shi,et al. PHANTOM: practical oblivious computation in a secure processor , 2013, CCS.
[50] Rafail Ostrovsky,et al. Efficient computation on oblivious RAMs , 1990, STOC '90.
[51] Craig Gentry,et al. Fully Homomorphic Encryption with Polylog Overhead , 2012, EUROCRYPT.
[52] Travis Mayberry,et al. Efficient Private File Retrieval by Combining ORAM and PIR , 2014, NDSS.
[53] Chris Peikert,et al. Better Key Sizes (and Attacks) for LWE-Based Encryption , 2011, CT-RSA.
[54] Elaine Shi,et al. Oblivious RAM with O((logN)3) Worst-Case Cost , 2011, ASIACRYPT.
[55] Shai Halevi,et al. Algorithms in HElib , 2014, CRYPTO.