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. 1105.4125
  4. Cited By
Privacy-Preserving Group Data Access via Stateless Oblivious RAM
  Simulation

Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation

20 May 2011
M. Goodrich
Michael Mitzenmacher
O. Ohrimenko
R. Tamassia
    FedML
ArXivPDFHTML

Papers citing "Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation"

4 / 4 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
Lower Bounds for Oblivious Data Structures
Lower Bounds for Oblivious Data Structures
R. Jacob
Kasper Green Larsen
J. Nielsen
29
37
0
24 Oct 2018
Oblivious RAM Simulation with Efficient Worst-Case Access Overhead
Oblivious RAM Simulation with Efficient Worst-Case Access Overhead
M. Goodrich
Michael Mitzenmacher
O. Ohrimenko
R. Tamassia
87
159
0
25 Jul 2011
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