暂无分享,去创建一个
[1] Zengjian Hu,et al. On weighted balls-into-bins games , 2005, Theor. Comput. Sci..
[2] Geong Sen Poh,et al. Searchable Symmetric Encryption , 2017, ACM Comput. Surv..
[3] Rasmus Pagh,et al. Cuckoo Hashing , 2001, Encyclopedia of Algorithms.
[4] Berthold Vöcking,et al. How asymmetry helps load balancing , 1999, JACM.
[5] Ioannis Demertzis,et al. Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency , 2018, IACR Cryptol. ePrint Arch..
[6] Ioannis Demertzis,et al. Fast Searchable Encryption With Tunable Locality , 2017, SIGMOD Conference.
[7] Moti Yung,et al. Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing , 2019, CCS.
[8] Michael T. Goodrich,et al. Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation , 2010, ICALP.
[9] Eli Upfal,et al. Balanced Allocations , 1999, SIAM J. Comput..
[10] Moni Naor,et al. Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations , 2016, STOC.
[11] D. A. Sprott. Urn Models and Their Application—An Approach to Modern Discrete Probability Theory , 1978 .
[12] David Cash,et al. The Locality of Searchable Symmetric Encryption , 2014, IACR Cryptol. ePrint Arch..
[13] Raphael Bost,et al. ∑oφoς: Forward Secure Searchable Encryption , 2016, CCS.
[14] Benny Pinkas,et al. Phasing: Private Set Intersection Using Permutation-based Hashing , 2015, USENIX Security Symposium.
[15] Brice Minaud,et al. SSE and SSD: Page-Efficient Searchable Symmetric Encryption , 2021, IACR Cryptol. ePrint Arch..
[16] Kunal Talwar,et al. Balanced allocations: the weighted case , 2007, STOC '07.
[17] Michael Mitzenmacher,et al. More Robust Hashing: Cuckoo Hashing with a Stash , 2008, ESA.
[18] Gil Segev,et al. Tight Tradeoffs in Searchable Symmetric Encryption , 2018, IACR Cryptol. ePrint Arch..
[19] Hugo Krawczyk,et al. Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation , 2014, NDSS.
[20] Kunal Talwar,et al. Balanced Allocations: A Simple Proof for the Heavily Loaded Case , 2013, ICALP.
[21] Ramesh K. Sitaraman,et al. The power of two random choices: a survey of tech-niques and results , 2001 .
[22] Elaine Shi,et al. Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM , 2017, ASIACRYPT.
[23] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.
[24] Michael T. Goodrich,et al. Oblivious RAM simulation with efficient worst-case access overhead , 2011, CCSW '11.
[25] Desh Ranjan,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[26] Michael T. Goodrich,et al. Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data , 2011, SPAA '11.