Fetching the paper…
Reading the bibliography…
A distributed computing scenario is considered, where the computational power of a set of worker nodes is used to perform a certain computation task over a dataset that is dispersed among the workers.
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.
A. Shamir, “How to share a secret,” Communications of the ACM , vol. 22, no. 11, pp. 612–613, 1979
1979
Earlier work this paper cites.
H. J. Nussbaumer, “The fast Fourier transform,” in Fast Fourier Transform and Convolution Algorithms . Springer, 1981, pp. 80–111
1981
Earlier work this paper cites.
A. C. Yao, “Protocols for secure computations,” in 23rd annual symposium on foundations of computer science (sfcs 1982) . IEEE, 1982, pp. 160–164
1982
Earlier work this paper cites.
S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of computer and system sciences , vol. 28, no. 2, pp. 270–299, 1984
1984
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.
J. W. Demmel, Applied numerical linear algebra . Siam, 1997, vol. 56
1997
Earlier work this paper cites.
R. Agrawal and R. Srikant, “Privacy-preserving data mining,” in Proceedings of the 2000 ACM SIGMOD international conference on Management of data , 2000, pp. 439–450
2000
Earlier work this paper cites.
C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M. Y. Zhu, “Tools for privacy preserving distributed data mining,” ACM Sigkdd Explorations Newsletter , vol. 4, no. 2, pp. 28–34, 2002
2002
Earlier work this paper cites.
L. Schumacher, K. I. Pedersen, and P. E. Mogensen, “From antenna spacings to theoretical capacities-guidelines for simulating MIMO systems,” in The 13th IEEE international symposium on personal, indoor and mobile radio communications , vol. 2. IEEE, 2002, pp. 587–592
2002
Earlier work this paper cites.
I. Dinur and K. Nissim, “Revealing information while preserving privacy,” in Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , 2003, pp. 202–210
2003
Earlier work this paper cites.
M. Rabbat and R. Nowak, “Distributed optimization in sensor networks,” in Proceedings of the 3rd international symposium on Information processing in sensor networks , 2004, pp. 20–27
2004
Earlier work this paper cites.
R. Wright and Z. Yang, “Privacy-preserving bayesian network structure computation on distributed heterogeneous data,” in Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining , 2004, pp. 713–718
2004
Earlier work this paper cites.
M. Kantarcioglu and C. Clifton, “Privacy-preserving distributed mining of association rules on horizontally partitioned data,” IEEE transactions on knowledge and data engineering , vol. 16, no. 9, pp. 1026–1037, 2004
2004
Earlier work this paper cites.
K. Liu, H. Kargupta, and J. Ryan, “Random projection-based multiplicative data perturbation for privacy preserving distributed data mining,” IEEE Transactions on knowledge and Data Engineering , vol. 18, no. 1, pp. 92–106, 2005
2005
Earlier work this paper cites.
D. Bogdanov, S. Laur, and J. Willemson, “Sharemind: A framework for fast privacy-preserving computations,” in European Symposium on Research in Computer Security . Springer, 2008, pp. 192–206
2008
Earlier work this paper cites.
S. Setty, V. Vu, N. Panpalia, B. Braun, A. J. Blumberg, and M. Walfish, “Taking proof-based verified computation a few steps closer to practicality,” in Presented as part of the 21st { \{ USENIX } \} Security Symposium ( { \{ USENIX } \} Security 12) , 2012, pp. 253–268
2012
Earlier work this paper cites.
M. Bellare, S. Tessaro, and A. Vardy, “A cryptographic treatment of the wiretap channel,” Advances in Cryptology – CRYPTO , 2012
2012
Earlier work this paper cites.
V. Nikolaenko, U. Weinsberg, S. Ioannidis, M. Joye, D. Boneh, and N. Taft, “Privacy-preserving ridge regression on hundreds of millions of records,” in 2013 IEEE Symposium on Security and Privacy . IEEE, 2013, pp. 334–348
2013
Earlier work this paper cites.
M. Aliasgari, M. Blanton, Y. Zhang, and A. Steele, “Secure computation on floating point numbers.” in NDSS , 2013
2013
Earlier work this paper cites.
R. Guerraoui, F. Huc, and A.-M. Kermarrec, “Highly dynamic distributed computing with Byzantine failures,” in Proceedings of the 2013 ACM symposium on Principles of distributed computing , 2013, pp. 176–183
2013
Cited alongside, same era.
C. Ling, L. Luzzi, J.-C. Belfiore, and D. Stehlé, “Semantically secure lattice codes for the gaussian wiretap channel,” IEEE Transactions on Information Theory , vol. 60, no. 10, pp. 6399–6416, 2014
2014
Cited alongside, same era.
R. Cramer, I. B. Damgård, and J. B. Nielsen, Secure multiparty computation . Cambridge University Press, 2015
2015
Cited alongside, same era.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Transactions on Information Theory , vol. 64, no. 3, pp. 1514–1529, 2017
2017
Cited alongside, same era.
M. Fahim and V. R. Cadambe, “Lagrange coded computing with sparsity constraints,” in 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . IEEE, 2019, pp. 284–289
2019
Later among the works it cites.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” in Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali , 2019, pp. 351–371
2019
Later among the works it cites.
2019
Later among the works it cites.
M. Fahim and V. R. Cadambe, “Numerically stable polynomially coded computing,” in 2019 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2019, pp. 3017–3021
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Gascón, P. Schoppmann, B. Balle, M. Raykova, J. Doerner, S. Zahur, and D. Evans, “Privacy-preserving distributed linear regression on high-dimensional data,” Proceedings on Privacy Enhancing Technologies , vol. 2017, no. 4, pp. 345–364, 2017
2017
Cited alongside, same era.
P. Mohassel and Y. Zhang, “SecureML: A system for scalable privacy-preserving machine learning,” in 2017 IEEE Symposium on Security and Privacy (SP) . IEEE, 2017, pp. 19–38
2017
Cited alongside, same era.
P. Blanchard, R. Guerraoui, J. Stainer et al. , “Machine learning with adversaries: Byzantine tolerant gradient descent,” in Advances in Neural Information Processing Systems , 2017, pp. 119–129
2017
Cited alongside, same era.
2018
Cited alongside, same era.
O. Catrina, “Towards practical secure computation with floating-point numbers,” in 3rd Annual International Conference on Cryptography and Information Security , 2018
2018
Cited alongside, same era.
N. Heydaribeni and A. Anastasopoulos, “Distributed mechanism design for unicast transmission,” in 2018 Information Theory and Applications Workshop (ITA) . IEEE, 2018, pp. 1–6
2018
Cited alongside, same era.
2018
Cited alongside, same era.
N. Heydaribeni and A. Anastasopoulos, “Distributed mechanism design for multicast transmission,” in 2018 IEEE Conference on Decision and Control (CDC) . IEEE, 2018, pp. 4200–4205
2018
Cited alongside, same era.
2019
Later among the works it cites.
A. B. Das and A. Ramamoorthy, “Distributed matrix-vector multiplication: A convolutional coding approach,” in 2019 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2019, pp. 3022–3026
2019
Later among the works it cites.
M. V. Jamali, M. Soleymani, and H. Mahdavifar, “Coded distributed computing: Performance limits and code designs,” in 2019 IEEE Information Theory Workshop (ITW) . IEEE, 2019, pp. 1–5
2019
Later among the works it cites.
2019
Later among the works it cites.
N. Heydaribeni and A. Anastasopoulos, “Distributed mechanism design for network resource allocation problems,” IEEE Transactions on Network Science and Engineering , 2019
2019
Later among the works it cites.
S. Li, S. Avestimehr et al. , “Coded computing,” Foundations and Trends® in Communications and Information Theory , vol. 17, no. 1, pp. 1–148, 2020
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
M. Aliasgari, O. Simeone, and J. Kliewer, “Private and secure distributed matrix multiplication with flexible communication load,” IEEE Transactions on Information Forensics and Security , vol. 15, pp. 2722–2734, 2020
2020
Closest in time.
R. G. D’Oliveira, S. El Rouayheb, and D. Karpuk, “GASP codes for secure distributed matrix multiplication,” IEEE Transactions on Information Theory , vol. 66, pp. 4038–4050, 2020
2020
Closest in time.
J. So, B. Guler, and S. Avestimehr, “A scalable approach for privacy-preserving collaborative machine learning,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Closest in time.
2020
Closest in time.
R. M. Roth, “Analog error-correcting codes,” IEEE Transactions on Information Theory , 2020
2020
Closest in time.
Q. Yu and A. S. Avestimehr, “Coded computing for resilient, secure, and privacy-preserving distributed matrix multiplication,” IEEE Transactions on Communications , vol. 69, no. 1, pp. 59–72, 2021
2021
Closest in time.