Secure distributed computAtioN - cryptoGRaphy, combinatorIcs and computer Algebra
ANR (2021-2025)

Research project funded by the french Agence Nationale de la Recherche (2021-2025). ANR-21-CE39-0006


  • École normale supérieure / DI-ENS
  • École polytechnique / LIX
  • Sorbonne Université / LIP6 and IMJ
  • Télécom Paris / LTCI
  • Université de Bordeaux / IMB
  • Université Grenoble Alpes / LJK
  • Université de Montpellier / LIRMM
  • Beginning and duration of the scientific project: October 2021 - 48 Months
  • Project coordinator: Damien Vergnaud

Project Summary

Cryptology is a crucial and ubiquitous component of cybersecurity. The development of information technology has brought great convenience to our lives but require cryptographic methods that go far beyond basic secure communication (i.e. confidentiality, integrity or authentication). The amount of sensitive data stored in digital form has grown tremendously and we now store and process them daily on nomad devices as well as in the cloud. This comes with many novel attack surfaces. Managing and protecting personal, financial or medical data is challenging and seems impossible for users with current tools.

Secure distributed computation has long stood in the realm of theoretical cryptography but it was known to have the potential to provide a disruptive change for practical security solutions. The concept was introduced by Yao in the 1980s and it allows mutually distrusting parties to run joint computations without disclosing any participant’s private inputs. New cryptographic tools have been invented in recent years (e.g. fully-homomorphic encryption, functional encryption, succinct proof systems...). These constructions have opened the door to applications that were previously believed unattainable in practice (e.g. Cloud Computing, Big Data, Blockchain or the Internet of Things). There is currently a strong interest in secure distributed computation from governments and security organisations (in particular the National Institute of Standards and Technology (NIST)), military, academia and industry. We are close to the stage where the secure distributed computation protocols can be applied to real-world security issues. We now list the main scientific challenges in the project.

The main scientific challenges are (1) to construct specific protocols that take into account practical constraints and prove them secure, (2) to implement them and to improve the efficiency of existing protocols significantly. The SANGRIA project (for Secure distributed computAtioN: cryptoGRaphy, combinatorIcs and computer Algebra) aims to undertake research in these two aspects while combining research from cryptography, combinatorics and computer algebra. It is expected to impact central problems in secure distributed computation, while enriching the general landscape of cryptography.



  1. A Tighter Proof for CCA Secure Inner Product Functional Encryption: Genericity Meets Efficiency
    Guilhem Castagnos, Fabien Laguillaumie, and Ida Tucker
    Theoretical Computer Science (2022).

(pictures credit: upklyak / Freepik)