Locality-Preserving Oblivious RAM
暂无分享,去创建一个
[1] Jeffrey Scott Vitter,et al. Algorithms and Data Structures for External Memory , 2008, Found. Trends Theor. Comput. Sci..
[2] Michael T. Goodrich,et al. Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation , 2010, ICALP.
[3] Peter Williams,et al. Usable PIR , 2008, NDSS.
[4] Radu Sion,et al. rORAM: Efficient Range ORAM with O(log2 N) Locality , 2019, NDSS.
[5] Elaine Shi,et al. Verifiable Oblivious Storage , 2014, Public Key Cryptography.
[6] Abhi Shelat,et al. SCORAM: Oblivious RAM for Secure Computation , 2014, IACR Cryptol. ePrint Arch..
[7] David Cash,et al. The Locality of Searchable Symmetric Encryption , 2014, IACR Cryptol. ePrint Arch..
[8] Pieter H. Hartel,et al. Computationally Efficient Searchable Symmetric Encryption , 2010, Secure Data Management.
[9] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[10] Moni Naor,et al. Is There an Oblivious RAM Lower Bound? , 2016, ITCS.
[11] Kai-Min Chung,et al. Statistically-secure ORAM with Õ(log2 n) Overhead , 2014, ASIACRYPT.
[12] Roberto Grossi,et al. On sorting strings in external memory (extended abstract) , 1997, STOC '97.
[13] Elaine Shi,et al. Oblivious RAM with O((logN)3) Worst-Case Cost , 2011, ASIACRYPT.
[14] Adam O'Neill,et al. Accessing Data while Preserving Privacy , 2017, ArXiv.
[15] Peter Williams,et al. Single round access privacy on outsourced storage , 2012, CCS '12.
[16] Charalampos Papamanthou,et al. Parallel and Dynamic Searchable Symmetric Encryption , 2013, Financial Cryptography.
[17] Sarvar Patel,et al. PanORAMa: Oblivious RAM with Logarithmic Overhead , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[18] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[19] Elaine Shi,et al. Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM , 2016, TCC.
[20] Rafail Ostrovsky,et al. On the (in)security of hash-based oblivious RAM and a new balancing scheme , 2012, SODA.
[21] Jeffrey Scott Vitter,et al. External memory algorithms and data structures , 1999, External Memory Algorithms.
[22] Hugo Krawczyk,et al. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..
[23] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[24] Michael T. Goodrich,et al. Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time , 2014, STOC.
[25] Gil Segev,et al. Tight Tradeoffs in Searchable Symmetric Encryption , 2018, IACR Cryptol. ePrint Arch..
[26] Lalit M. Patnaik,et al. Genetic algorithms: a survey , 1994, Computer.
[27] Peter Williams,et al. Building castles out of mud: practical access pattern privacy and correctness on untrusted storage , 2008, CCS.
[28] Elaine Shi,et al. Foundations of Differentially Oblivious Algorithms , 2017, IACR Cryptol. ePrint Arch..
[29] Jeffrey Scott Vitter,et al. External memory algorithms and data structures: dealing with massive data , 2001, CSUR.
[30] Ioannis Demertzis,et al. Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency , 2018, IACR Cryptol. ePrint Arch..
[31] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[32] Rafail Ostrovsky,et al. Searchable symmetric encryption: Improved definitions and efficient constructions , 2011, J. Comput. Secur..
[33] Kartik Nayak,et al. Perfectly Secure Oblivious Parallel RAM , 2018, IACR Cryptol. ePrint Arch..
[34] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[35] Elaine Shi,et al. Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound , 2015, IACR Cryptol. ePrint Arch..
[36] Oded Goldreich,et al. Towards a theory of software protection and simulation by oblivious RAMs , 1987, STOC.
[37] Kasper Green Larsen,et al. Yes, There is an Oblivious RAM Lower Bound! , 2018, IACR Cryptol. ePrint Arch..
[38] Kartik Nayak,et al. OptORAMa: Optimal Oblivious RAM , 2020, IACR Cryptol. ePrint Arch..
[39] Ioannis Demertzis,et al. Fast Searchable Encryption With Tunable Locality , 2017, SIGMOD Conference.
[40] Moni Naor,et al. Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations , 2016, STOC.
[41] John Wilkes,et al. An introduction to disk drive modeling , 1994, Computer.
[42] Ling Ren,et al. Path ORAM , 2012, J. ACM.
[43] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[44] E. Szemerédi,et al. O(n LOG n) SORTING NETWORK. , 1983 .
[45] Melissa Chase,et al. Structured Encryption and Controlled Disclosure , 2010, IACR Cryptol. ePrint Arch..
[46] Adam O'Neill,et al. Generic Attacks on Secure Outsourced Databases , 2016, CCS.
[47] Kaoru Kurosawa,et al. How to Update Documents Verifiably in Searchable Symmetric Encryption , 2013, CANS.