Achievable Rate of Private Function Retrieval from MDS Coded Databases

被引：0
|
作者：
Obead, Sarah A. [1 ]
Kliewer, Jorg [1 ]
机构：
[1] New Jersey Inst Technol, Helen & John C Hartmann Dept Elect & Comp Engn, Newark, NJ 07102 USA
来源：
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2018年
关键词：
INFORMATION-RETRIEVAL;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study the problem of private function retrieval (PFR) in a distributed storage system. In PFR the user wishes to retrieve a linear combination of M messages stored in non-colluding (N;K) MDS coded databases while revealing no information about the coefficients of the intended linear combination to any of the individual databases. We present an achievable scheme for MDS coded PFR with a rate that matches the capacity for coded private information retrieval derived recently, R = (1 + R-c +R-c(2) + ... + R-c(M-1))(-1) = 1-R-c/R-c(M), where R-c = K/N is the rate of the MDS code.
引用
收藏
页码：2117 / 2121
页数：5
相关论文
共 50 条
  • [11] Private Information Retrieval From MDS Coded Data in Distributed Storage Systems
    Tajeddine, Razane
    Gnilke, Oliver W.
    El Rouayheb, Salim
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (11) : 7081 - 7093
  • [12] Symmetric Private Information Retrieval For MDS Coded Distributed Storage
    Wang, Qiwen
    Skoglund, Mikael
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [13] On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers
    Allaix, Matteo
    Song, Seunghoan
    Holzbaur, Lukas
    Pllaha, Tefjol
    Hayashi, Masahito
    Hollanti, Camilla
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2022, 40 (03) : 885 - 898
  • [14] Private Polynomial Function Computation for Noncolluding Coded Databases
    Obead, Sarah A.
    Lin, Hsuan-Yin
    Rosnes, Eirik
    Kliewer, Jorg
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2022, 17 : 1800 - 1813
  • [15] Linear Symmetric Private Information Retrieval for MDS Coded Distributed Storage with Colluding Servers
    Wang, Qiwen
    Skoglund, Mikael
    2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 71 - 75
  • [16] Symmetric Private Information Retrieval from MDS Coded Distributed Storage With Non-Colluding and Colluding Servers
    Wang, Qiwen
    Skoglund, Mikael
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (08) : 5160 - 5175
  • [17] X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers
    Jia, Zhuqing
    Jafar, Syed Ali
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (12) : 7427 - 7438
  • [18] Private Information Retrieval from Byzantine and Colluding Databases
    Banawan, Karim
    Ulukus, Sennur
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 1091 - 1098
  • [19] Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers
    Yan, Qifa
    Tuninetti, Daniela
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 78 - 83
  • [20] Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al
    Sun, Hua
    Jafar, Syed Ali
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (02) : 1000 - 1022
12345