Fetching the paper…
Reading the bibliography…
Learning from data owned by several parties, as in federated learning, raises challenges regarding the privacy guarantees provided to participants and the correctness of the computation in the presence of malicious parties.
Combinatorica 2
Fenner, T.I., Frieze, A.M.: On the connectivity of random m-orientable graphs and digraphs · 1982
Earlier work this paper cites.
Yao, A.C.: Theory and application of trapdoor functions · 1982
Earlier work this paper cites.
ACM SIGACT News 15
Blum, M.: Coin flipping by telephone a protocol for solving impossible problems · 1983
Earlier work this paper cites.
In: A.M. Odlyzko (ed.) Advances in Cryptology — CRYPTO’ 86, Lecture Notes in Computer Science, pp. 186–194. Springer, Berlin, Heidelberg (1987)
Fiat, A., Shamir, A.: How To Prove Yourself: Practical Solutions to Identification and Signature Problems · 1987
Earlier work this paper cites.
In: D. Chaum, W.L. Price (eds.) Advances in Cryptology — EUROCRYPT’ 87, Lecture Notes in Computer Science, pp. 127–141. Springer, Berlin, Heidelberg (1988)
Chaum, D., Evertse, J.H., van de Graaf, J.: An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations · 1988
Earlier work this paper cites.
SIAM Journal on Computing 18
Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems · 1989
Earlier work this paper cites.
In: CRYPTO (1991)
Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing · 1991
Earlier work this paper cites.
Journal of Cryptology 4
Schnorr, C.P.: Efficient signature generation by smart cards · 1991
Earlier work this paper cites.
In: Proceedings of the 1st ACM conference on Computer and communications security, CCS ’93, pp. 62–73. Association for Computing Machinery, New York, NY, USA (1993)
Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols · 1993
Earlier work this paper cites.
In: E.F. Brickell (ed.) Advances in Cryptology — CRYPTO’ 92, Lecture Notes in Computer Science, pp. 89–105. Springer, Berlin, Heidelberg (1993)
Chaum, D., Pedersen, T.P.: Wallet Databases with Observers · 1993
Earlier work this paper cites.
In: CRYPTO (1994)
Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols · 1994
Earlier work this paper cites.
Ph.D. thesis, University of Amsterdam (1997)
Cramer, R.: Modular Design of Secure yet Practical Cryptographic Protocols · 1997
Earlier work this paper cites.
In: CRYPTO (1998)
Cramer, R., Damgård, I.: Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? · 1998
Earlier work this paper cites.
Manuscript. Preliminary version (1998)
Goldreich, O.: Secure multi-party computation · 1998
Earlier work this paper cites.
In: H. Imai, Y. Zheng (eds.) Public Key Cryptography, Lecture Notes in Computer Science, pp. 60–71. Springer, Berlin, Heidelberg (1998)
Mao, W.: Guaranteed correct sharing of integer factorization with off-line shareholders · 1998
Earlier work this paper cites.
In: EUROCRYPT (1999)
Camenisch, J., Michels, M.: Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes · 1999
Earlier work this paper cites.
Cambridge University Press (2001)
Bollobás, B.: Random Graphs (2nd edition) · 2001
Earlier work this paper cites.
In: S&P (2003)
Chan, H., Perrig, A., Song, D.X.: Random Key Predistribution Schemes for Sensor Networks · 2003
Earlier work this paper cites.
Journal of Cryptology 16
Lindell: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation · 2003
Earlier work this paper cites.
Tech. rep., Naval Research Lab Washington DC (2004)
Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router · 2004
Earlier work this paper cites.
IEEE/ACM Transactions on Networking 14
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms · 2006
Earlier work this paper cites.
In: ICALP (2006)
Dwork, C.: Differential Privacy · 2006
Earlier work this paper cites.
In: EUROCRYPT (2006)
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our Data, Ourselves: Privacy Via Distributed Noise Generation · 2006
Earlier work this paper cites.
NIST Special Publication (NIST SP) (2007)
Barker, E.B., Kelsey, J.M.: Recommendation for random number generation using deterministic random bit generators (revised) · 2007
Earlier work this paper cites.
Research Report RR-6465, INRIA (2008)
Chevillard, S., Revol, N.: Computation of the error functions erf & erfc in arbitrary precision with correct rounding · 2008
Cited alongside, same era.
In: FOCS (2008)
Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.D.: What Can We Learn Privately? · 2008
Cited alongside, same era.
Available online at http://bitcoin.org/bitcoin.pdf (2008)
Nakamoto, S.: Bitcoin: A Peer-to-Peer Electronic Cash System · 2008
Cited alongside, same era.
In: International Workshop on Cryptographic Hardware and Embedded Systems (2010)
Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge-based pseudo-random number generators · 2010
Cited alongside, same era.
SIAM J. Discret. Math. 24
Krivelevich, M.: Embedding spanning trees in random graphs · 2010
Cited alongside, same era.
In: NDSS (2011)
Shi, E., Chan, T.H.H., Rieffel, E.G., Chow, R., Song, D.: Privacy-Preserving Aggregation of Time-Series Data · 2011
Cited alongside, same era.
In: ITCS (2018)
Balcer, V., Vadhan, S.: Differential Privacy on Finite Computers · 2018
Later among the works it cites.
In: NeurIPS (2018)
Hayes, J., Ohrimenko, O.: Contamination attacks and mitigation in multi-party machine learning · 2018
Later among the works it cites.
In: NeurIPS (2018)
Jayaraman, B., Wang, L., Evans, D., Gu, Q.: Distributed learning without distress: Privacy-preserving empirical risk minimization · 2018
Later among the works it cites.
In: USENIX Security (2018)
Narula, N., Vasquez, W., Virza, M.: zkLedger: Privacy-Preserving Auditing for Distributed Ledgers · 2018
Later among the works it cites.
In: ICML (2019)
Bhagoji, A.N., Chakraborty, S., Mittal, P., Calo, S.B.: Analyzing federated learning through an adversarial lens · 2019
Later among the works it cites.
In: EUROCRYPT (2019)
Cheu, A., Smith, A.D., Ullman, J., Zeber, D., Zhilyaev, M.: Distributed Differential Privacy via Shuffling · 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…
In: ASIACRYPT (2012)
Bernhard, D., Pereira, O., Warinschi, B.: How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios · 2012
Cited alongside, same era.
In: ESA (2012)
Chan, T.H.H., Shi, E., Song, D.: Optimal Lower Bound for Differentially Private Multi-party Aggregation · 2012
Cited alongside, same era.
In: Financial Cryptography (2012)
Chan, T.H.H., Shi, E., Song, D.: Privacy-preserving stream aggregation with fault tolerance · 2012
Cited alongside, same era.
In: FOCS (2013)
Duchi, J.C., Jordan, M.I., Wainwright, M.J.: Local privacy and statistical minimax rates · 2013
Cited alongside, same era.
IEEE Transactions on Information Theory 59
Yağan, O., Makowski, A.M.: On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution · 2013
Cited alongside, same era.
In: S&P (2014)
Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: Decentralized Anonymous Payments from Bitcoin · 2014
Cited alongside, same era.
In: SODA (2019)
Erlingsson, U., Feldman, V., Mironov, I., Raghunathan, A., Talwar, K.: Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity · 2019
Later among the works it cites.
Tech. rep., arXiv:1906.11993 (2019)
Hartmann, V., West, R.: Privacy-Preserving Distributed Learning with Secret Gradient Descent · 2019
Later among the works it cites.
In: S&P (2019)
Melis, L., Song, C., Cristofaro, E.D., Shmatikov, V.: Exploiting unintended feature leakage in collaborative learning · 2019
Later among the works it cites.
In: S&P (2019)
Nasr, M., Shokri, R., Houmansadr, A.: Comprehensive privacy analysis of deep learning: Passive and active white-box inference attacks against centralized and federated learning · 2019
Later among the works it cites.
In: ICLR (2019)
Stich, S.U.: Local SGD Converges Fast and Communicates Little · 2019
Later among the works it cites.
In: AISTATS (2020)
Bagdasaryan, E., Veit, A., Hua, Y., Estrin, D., Shmatikov, V.: How to backdoor federated learning · 2020
Closest in time.
In: CCS (2020)
Balle, B., Bell, J., Gascón, A., Nissim, K.: Private Summation in the Multi-Message Shuffle Model · 2020
Closest in time.
In: AISTATS (2020)
Bell, J., Bellet, A., Gascón, A., Kulkarni, T.: Private Protocols for U-Statistics in the Local Model and Beyond · 2020
Closest in time.
In: CCS (2020)
Bell, J.H., Bonawitz, K.A., Gascón, A., Lepoint, T., Raykova, M.: Secure Single-Server Aggregation with (Poly)Logarithmic Overhead · 2020
Closest in time.
In: NeurIPS (2020)
Chen, W.N., Kairouz, P., Ozgur, A.: Breaking the communication-privacy-accuracy trilemma · 2020
Closest in time.
In: NeurIPS (2020)
Geiping, J., Bauermeister, H., Dröge, H., Moeller, M.: Inverting gradients - how easy is it to break privacy in federated learning? · 2020
Closest in time.
In: ICML (2020)
Ghazi, B., Kumar, R., Manurangsi, P., Pagh, R.: Private counting from anonymous messages: Near-optimal accuracy with vanishing communication overhead · 2020
Closest in time.
In: ICLR (2020)
Lin, T., Stich, S.U., Patel, K.K., Jaggi, M.: Don’t Use Large Mini-batches, Use Local SGD · 2020
Closest in time.
In: NeurIPS (2021)
Agarwal, N., Kairouz, P., Liu, Z.: The skellam mechanism for differentially private federated learning · 2021
Closest in time.
arXiv preprint arXiv:1904.10059 (2021)
Imtiaz, H., Mohammadi, J., Sarwate, A.D.: Distributed differentially private computation of functions with correlated noise · 2021
Closest in time.
In: ICML (2021)
Kairouz, P., Liu, Z., Steinke, T.: The distributed discrete gaussian mechanism for federated learning with secure aggregation · 2021
Closest in time.
Foundations and Trends® in Machine Learning 14
Kairouz, P., McMahan, H.B., Avent, B., Bellet, A., et al.: Advances and open problems in federated learning · 2021
Closest in time.