X-Secure T-Private Federated Submodel Learning With Elastic Dropout Resilience

被引:8
|
作者
Jia, Zhuqing [1 ]
Jafar, Syed Ali [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Artificial Intelligence, Beijing 100876, Peoples R China
[2] Univ Calif Irvine, Ctr Pervas Commun & Comp, Dept Elect Engn & Comp Sci, Irvine, CA 92697 USA
关键词
Federated learning; security; privacy; INFORMATION-RETRIEVAL CODES; CROSS SUBSPACE ALIGNMENT; ASYMPTOTIC CAPACITY; STORAGE; DATABASES; BYZANTINE;
D O I
10.1109/TIT.2022.3165400
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Motivated by recent interest in federated submodel learning, this work explores the fundamental problem of privately reading from and writing to a database comprised of K files (submodels) that are stored across N distributed servers according to an X-secure threshold secret sharing scheme. One after another, various users wish to retrieve their desired file, locally process the information and then update the file in the distributed database while keeping the identity of their desired file private from any set of up to T colluding servers. The availability of servers changes over time, so elastic dropout resilience is required. The main contribution of this work is an adaptive scheme, called ACSA-RW, that takes advantage of all currently available servers to reduce its communication costs, fully updates the database after each write operation even though the database is only partially accessible due to server dropouts, and ensures a memoryless operation of the network in the sense that the storage structure is preserved and future users may remain oblivious of the past history of server dropouts. The ACSA-RW construction builds upon cross subspace alignment (CSA) codes that were originally introduced for X-secure T-private information retrieval and have been shown to be natural solutions for secure distributed batch matrix multiplication problems. ACSA-RW achieves the desired private read and write functionality with elastic dropout resilience, matches the best results for private-read from PIR literature, improves significantly upon available baselines for private-write, reveals a striking symmetry between upload and download costs, and exploits storage redundancy to accommodate arbitrary read and write dropout servers up to certain threshold values. It also answers in the affirmative an open question by Kairouz et al. for the case of partially colluding servers (i.e., tolerating collusion up to a threshold) by exploiting synergistic gains from the joint design of private read and write operations.
引用
收藏
页码:5418 / 5439
页数:22
相关论文
共 34 条
  • [1] X-Secure T-Private Federated Submodel Learning
    Jia, Zhuqing
    Jafar, Syed A.
    [J]. IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021), 2021,
  • [2] X-Secure T-Private Linear Computation With Graph Based Replicated Storage
    Jia, Haobo
    Jia, Zhuqing
    [J]. IEEE International Symposium on Information Theory - Proceedings, 2023, 2023-June : 1586 - 1591
  • [3] Asymmetric X-Secure T-Private Information Retrieval: More Databases is Not Always Better
    Nomeir, Mohamed
    Vithana, Sajani
    Ulukus, Sennur
    [J]. 2024 58TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, CISS, 2024,
  • [4] X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers
    Jia, Zhuqing
    Jafar, Syed Ali
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (12) : 7427 - 7438
  • [5] The Asymptotic Capacity of X-Secure T-Private Linear Computation With Graph Based Replicated Storage
    Jia, Haobo
    Jia, Zhuqing
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (07) : 5269 - 5288
  • [6] On the Asymptotic Capacity of X-Secure T-Private Information Retrieval With Graph-Based Replicated Storage
    Jia, Zhuqing
    Jafar, Syed Ali
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (10) : 6280 - 6296
  • [7] t-private and secure auctions
    Hinkelmann, Markus
    Jakoby, Andreas
    Stechert, Peer
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 486 - +
  • [8] Fast Secure Aggregation With High Dropout Resilience for Federated Learning
    Yang, Shisong
    Chen, Yuwen
    Yang, Zhen
    Li, Bowen
    Liu, Huan
    [J]. IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, 2023, 7 (03): : 1501 - 1514
  • [9] Efficient Private Federated Submodel Learning
    Vithana, Sajani
    Ulukus, Sennur
    [J]. IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, : 3394 - 3399
  • [10] Private Federated Submodel Learning with Sparsification
    Vithana, Sajani
    Ulukus, Sennur
    [J]. 2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 410 - 415