Fetching the paper…
Reading the bibliography…
In the robust secure aggregation problem, a server wishes to learn and only learn the sum of the inputs of a number of users while some users may drop out (i.e., may not respond).
C. E. Shannon, “Communication Theory of Secrecy Systems,” Bell System Technical Journal , vol. 28, no. 4, pp. 656–715, 1949
1949
Earlier work this paper cites.
S. Schechter, “On the inversion of certain matrices,” Mathematical Tables and Other Aids to Computation , vol. 13, no. 66, pp. 73–77, 1959
1959
Earlier work this paper cites.
A. Shamir, “How to Share a Secret,” Communications of the ACM , vol. 22, pp. 612–613, 1979
1979
Earlier work this paper cites.
G. Blakley, “Safeguarding Cryptographic Keys,” in Proceedings of the 1979 AFIPS National Computer Conference , 1979, pp. 313–317
1979
Earlier work this paper cites.
R. J. McEliece and D. V. Sarwate, “On sharing secrets and reed-solomon codes,” Communications of the ACM , vol. 24, no. 9, pp. 583–584, 1981
1981
Earlier work this paper cites.
G. R. Blakley and C. Meadows, “Security of ramp schemes,” in Workshop on the Theory and Application of Cryptographic Techniques . Springer, 1984, pp. 242–268
1984
Earlier work this paper cites.
H. Yamamoto, “Secret sharing system using (k, l, n) threshold scheme,” Electronics and Communications in Japan (Part I: Communications) , vol. 69, no. 9, pp. 46–54, 1986
1986
Earlier work this paper cites.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation,” in Proceedings of the twentieth annual ACM symposium on Theory of computing . ACM, 1988, pp. 1–10
1988
Earlier work this paper cites.
D. Chaum, C. Crépeau, and I. Damgard, “Multiparty Unconditionally Secure Protocols,” in Proceedings of the twentieth annual ACM symposium on Theory of computing . ACM, 1988, pp. 11–19
1988
Earlier work this paper cites.
B. Chor and E. Kushilevitz, “A communication-privacy tradeoff for modular addition,” Information Processing Letters , vol. 45, no. 4, pp. 205–210, 1993
1993
Earlier work this paper cites.
U. Feige, J. Killian, and M. Naor, “A Minimal Model for Secure Computation,” in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing . ACM, 1994, pp. 554–563
1994
Earlier work this paper cites.
Y. Ishai and E. Kushilevitz, “Private Simultaneous Messages Protocols with Applications,” in Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems . IEEE, 1997, pp. 174–183
1997
Earlier work this paper cites.
E. Kushilevitz and A. Rosén, “A randomness-rounds tradeoff in private computation,” SIAM Journal on Discrete Mathematics , vol. 11, no. 1, pp. 61–80, 1998
1998
Earlier work this paper cites.
J. Kurihara, S. Kiyomoto, K. Fukushima, and T. Tanaka, “A new (k, n)-threshold secret sharing scheme and its extension,” in International Conference on Information Security . Springer, 2008, pp. 455–470
2008
Earlier work this paper cites.
J. Katz and Y. Lindell, Introduction to modern cryptography . Chapman and Hall/CRC, 2014
2014
Earlier work this paper cites.
2016
Cited alongside, same era.
D. Data, V. M. Prabhakaran, and M. M. Prabhakaran, “Communication and Randomness Lower Bounds for Secure Computation,” IEEE Transactions on Information Theory , vol. 62, no. 7, pp. 3901–3929, 2016
2016
Cited alongside, same era.
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Artificial Intelligence and Statistics . PMLR, 2017, pp. 1273–1282
2017
Cited alongside, same era.
——, “Practical secure aggregation for privacy-preserving machine learning,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 1175–1191
2017
Cited alongside, same era.
J. H. Bell, K. A. Bonawitz, A. Gascón, T. Lepoint, and M. Raykova, “Secure single-server aggregation with (poly) logarithmic overhead,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security , 2020, pp. 1253–1269
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
T. Guo, R. Zhou, and C. Tian, “On the information leakage in private information retrieval systems,” IEEE Transactions on Information Forensics and Security , vol. 15, pp. 2999–3012, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Q. Wang, H. Sun, and M. Skoglund, “The ϵ \epsilon -Error Capacity of Symmetric PIR with Byzantine Adversaries,” in 2018 IEEE Information Theory Workshop (ITW) . IEEE, 2018, pp. 1–5
2018
Cited alongside, same era.
D. R. Stinson and M. Paterson, Cryptography: Theory and Practice . CRC press, 2018
2018
Cited alongside, same era.
2019
Cited alongside, same era.
Y. Zhou, H. Sun, and S. Fu, “On the Randomness Cost of Linear Secure Computation,” in 2019 53rd Annual Conference on Information Sciences and Systems (CISS) , March 2019, pp. 1–6
2019
Cited alongside, same era.
H. Sun and S. A. Jafar, “The Capacity of Symmetric Private Information Retrieval,” IEEE Transactions on Information Theory , vol. 65, no. 1, pp. 322–329, 2019
2019
Cited alongside, same era.
Z. Jia, H. Sun, and S. A. Jafar, “Cross Subspace Alignment and the Asymptotic Capacity of X–Secure T–Private Information Retrieval,” IEEE Transactions on Information Theory , vol. 65, no. 9, pp. 5783–5798, 2019
2019
Cited alongside, same era.
——, “Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness,” in 2019 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2019, pp. 365–369
2019
Cited alongside, same era.
K. Bonawitz, F. Salehi, J. Konečnỳ, B. McMahan, and M. Gruteser, “Federated learning with autotuned communication-efficient secure aggregation,” in 2019 53rd Asilomar Conference on Signals, Systems, and Computers . IEEE, 2019, pp. 1222–1226
2019
Cited alongside, same era.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
D. Lia and M. Togan, “Privacy-preserving machine learning using federated learning and secure aggregation,” in 2020 12th International Conference on Electronics, Computers and Artificial Intelligence (ECAI) . IEEE, 2020, pp. 1–6
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.