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. 1609.07027
  4. Cited By
PIR schemes with small download complexity and low storage requirements
v1v2v3v4 (latest)

PIR schemes with small download complexity and low storage requirements

22 September 2016
S. Blackburn
T. Etzion
Maura B. Paterson
ArXiv (abs)PDFHTML

Papers citing "PIR schemes with small download complexity and low storage requirements"

4 / 4 papers shown
Private Information Retrieval in Graph Based Replication Systems
Private Information Retrieval in Graph Based Replication Systems
Netanel Raviv
Itzhak Tamo
Eitan Yaakobi
185
60
0
04 Dec 2018
Capacity-Achieving Private Information Retrieval Codes with Optimal
  Message Size and Upload Cost
Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost
C. Tian
Hua Sun
Jun Chen
167
136
0
22 Aug 2018
Multiround Private Information Retrieval: Capacity and Storage Overhead
Multiround Private Information Retrieval: Capacity and Storage Overhead
Hua Sun
S. Jafar
89
84
0
07 Nov 2016
Optimal Download Cost of Private Information Retrieval for Arbitrary
  Message Length
Optimal Download Cost of Private Information Retrieval for Arbitrary Message LengthIEEE Transactions on Information Forensics and Security (TIFS), 2016
Hua Sun
S. Jafar
115
97
0
10 Oct 2016
1
Page 1 of 1