Skip to main content

Post-quantum Privacy-Preserving Aggregation in Federated Learning Based on Lattice

  • Conference paper
  • First Online:
Cyberspace Safety and Security (CSS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13547))

Included in the following conference series:

  • 901 Accesses

Abstract

With the fast growth of quantum computers in recent years, the use of post-quantum cryptography has steadily become vital. In the privacy-preserving aggregation of federated learning, different cryptographic primitives, such as encryption, key agreement, digital signature, secret-sharing, and pseudorandom generator, may be used to protect users’ privacy. However, in the original privacy-preserving aggregation protocol, the classical cryptographic primitives are vulnerable to quantum attacks. Bonawitz et al. presented the SecAgg (Secure Aggregation) protocol, which is based on double-masking MPC (Multi-Party Computation). On this basis, we took advantage of the structure of the original protocol and the properties of lattice cryptography to apply lattice cryptography schemes to the protocol and presented a lattice-based post-quantum privacy-preserving aggregation protocol, which can withstand quantum attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Yang, Q., et al.: Federated machine learning: concept and applications. ACM Trans. Intell. Syst. Technol. (TIST) 10(2), 1–19 (2019)

    Article  Google Scholar 

  2. Bonawitz, K., et al.: Practical secure aggregation for privacy-preserving machine learning. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (2017)

    Google Scholar 

  3. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)

    Article  MathSciNet  Google Scholar 

  4. Bernstein, D.J.: Introduction to post-quantum cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 1–14. Springer, Berlin, Heidelberg (2009) . https://doi.org/10.1007/978-3-540-88702-7_1

  5. De Feo, L.: Mathematics of isogeny based cryptography. arXiv preprint arXiv:1711.04062 (2017)

  6. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  Google Scholar 

  7. Bos, J., et al.: Frodo: Take off the ring! Practical, quantum-secure key exchange from LWE. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (2016)

    Google Scholar 

  8. CYBER: Quantum-Safe Key Exchanges (V1.1.1). ETSI TR 103 570–2017 (2017)

    Google Scholar 

  9. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)

    Article  MathSciNet  Google Scholar 

  10. Fouque, P.-A., et al.: Falcon: fast-Fourier lattice-based compact signatures over NTRU. Submiss. NIST’s Post-quantum Cryptogr. Standard. Process. 36(5), 1–7 (2018)

    Google Scholar 

  11. Grover, L.K.: From Schrödinger’s equation to the quantum search algorithm. Pramana 56(2), 333–348 (2001)

    Article  Google Scholar 

  12. Dworkin, M.J., et al.: Advanced encryption standard (AES) (2001)

    Google Scholar 

  13. Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595–618. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03356-8_35

    Chapter  Google Scholar 

  14. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1–40 (2009)

    Article  MathSciNet  Google Scholar 

  15. Dworkin, M.J.: Recommendation for block cipher modes of operation: Galois/Counter Mode (GCM) and GMAC (2007)

    Google Scholar 

  16. Choi, B., et al.: Communication-computation efficient secure aggregation for federated learning. arXiv preprint arXiv:2012.05433 (2020)

  17. Alexandru, A.B., Pappas, G.J.: Private weighted sum aggregation for distributed control systems. IFAC-PapersOnLine 53(2), 11081–11088 (2020)

    Article  Google Scholar 

  18. Stripelis, D., et al.: Secure neuroimaging analysis using federated learning with homomorphic encryption. In: 17th International Symposium on Medical Information Processing and Analysis, vol. 12088. SPIE (2021)

    Google Scholar 

Download references

Acknowledgements

This work is supported by Guangdong Major Project of Basic and Applied Basic Research (2019B030302008) and the National Natural Science Foundation of China (No. 61972429).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fangguo Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zuo, R., Tian, H., An, Z., Zhang, F. (2022). Post-quantum Privacy-Preserving Aggregation in Federated Learning Based on Lattice. In: Chen, X., Shen, J., Susilo, W. (eds) Cyberspace Safety and Security. CSS 2022. Lecture Notes in Computer Science, vol 13547. Springer, Cham. https://doi.org/10.1007/978-3-031-18067-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-18067-5_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-18066-8

  • Online ISBN: 978-3-031-18067-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics