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. 1402.5524
  4. Cited By
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud

22 February 2014
O. Ohrimenko
M. Goodrich
R. Tamassia
E. Upfal
ArXivPDFHTML

Papers citing "The Melbourne Shuffle: Improving Oblivious Storage in the Cloud"

5 / 5 papers shown
Title
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort
Gilad Asharov
T-H. Hubert Chan
Kartik Nayak
R. Pass
Ling Ren
E. Shi
24
33
0
04 Aug 2020
On the Complexity of Anonymous Communication Through Public Networks
On the Complexity of Anonymous Communication Through Public Networks
Megumi Ando
Anna Lysyanskaya
E. Upfal
21
9
0
17 Feb 2019
An Algorithmic Framework For Differentially Private Data Analysis on
  Trusted Processors
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors
Joshua Allen
Bolin Ding
Janardhan Kulkarni
Harsha Nori
O. Ohrimenko
Sergey Yekhanin
SyDa
FedML
27
32
0
02 Jul 2018
CacheShuffle: An Oblivious Shuffle Algorithm Using Caches
CacheShuffle: An Oblivious Shuffle Algorithm Using Caches
Sarvar Patel
G. Persiano
Kevin Yeo
31
9
0
19 May 2017
Privacy-Preserving Access of Outsourced Data via Oblivious RAM
  Simulation
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
M. Goodrich
Michael Mitzenmacher
71
269
0
07 Jul 2010
1