ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1810.10635
  4. Cited By
Lower Bounds for Oblivious Data Structures

Lower Bounds for Oblivious Data Structures

24 October 2018
R. Jacob
Kasper Green Larsen
J. Nielsen
ArXivPDFHTML

Papers citing "Lower Bounds for Oblivious Data Structures"

3 / 3 papers shown
Title
Lower Bounds for Oblivious Near-Neighbor Search
Lower Bounds for Oblivious Near-Neighbor Search
Kasper Green Larsen
T. Malkin
Omri Weinstein
Kevin Yeo
19
20
0
09 Apr 2019
Stronger Lower Bounds for Online ORAM
Stronger Lower Bounds for Online ORAM
Pavel Hubácek
M. Koucký
Karel Král
Veronika Slívová
11
15
0
08 Mar 2019
Privacy-Preserving Access of Outsourced Data via Oblivious RAM
  Simulation
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
M. Goodrich
Michael Mitzenmacher
63
269
0
07 Jul 2010
1