ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.05145
  4. Cited By
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
v1v2v3 (latest)

Sub-logarithmic Distributed Oblivious RAM with Small Block Size

14 February 2018
E. Kushilevitz
Tamer Mour
ArXiv (abs)PDFHTML

Papers citing "Sub-logarithmic Distributed Oblivious RAM with Small Block Size"

2 / 2 papers shown
Bandwidth-Efficient Two-Server ORAMs with O(1) Client Storage
Bandwidth-Efficient Two-Server ORAMs with O(1) Client Storage
Wei Wang
Xianglong Zhang
Peng Xu
Rongmao Chen
Laurence T. Yang
267
0
0
27 Mar 2025
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server
  Setting
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting
T-H. Hubert Chan
Jonathan Katz
Kartik Nayak
Antigoni Polychroniadou
E. Shi
125
27
0
04 Sep 2018
1
Page 1 of 1