Description du projet
Des protocoles cryptographiques robustes pour faire face aux attaques quantiques
En cryptographie, une preuve à divulgation nulle de connaissance est un protocole dans lequel une entité (fournisseur de preuve) prouve mathématiquement la validité d’une proposition à une autre entité (le vérificateur) sans transmettre d’informations supplémentaires. Le projet PLAZA, financé par l’UE, a pour objectif de créer des preuves à divulgation nulle de connaissance pratiques, capables de résister aux attaques quantiques. Le projet utilisera des problèmes de réseaux durs, qui constituent un ensemble très prometteur d’hypothèses pouvant être exploitées pour créer les systèmes de cryptage et de signature numérique les plus efficaces résistant aux attaques quantiques. Le défi consistera à créer des schémas plus complexes, mais pratiques, basés sur des réseaux et à construire des preuves à divulgation nulle de connaissance plus efficaces.
Objectif
The world is on a seemingly irreversible path towards a more privacy-oriented and decentralized mode of
storing and operating on data. A lot of this transformation is being enabled by advanced cryptography that’s
designed to cut out the need for trusted third parties that we rely on today. The effect of this transformation
is a more secure and, at the same time, a more efficient way of interaction in which the manual checks and
audits are instead embedded into the cryptographic protocols themselves. Another technological development
that’s on the horizon is a general-purpose quantum computer, whose utility comes from the fact that it will
be able to solve some problems considerably faster than a classical computer. Because of the multitude of
its positive scientific applications, building such a computer is being vigorously pursued by governments and
private companies. The main negative consequence of quantum computing is that it breaks most of the
cryptography that’s crucial to the privacy transformation.
The main ingredient of privacy-centric cryptography is a zero-knowledge proof for showing knowledge
of an x satisfying f(x) = y without revealing anything else about x. The most compact zero-knowledge
proofs currently rely on the hardness of various mathematical assumptions which are no longer difficult in
the presence of quantum computers. The central objective of the PLAZA project will be to create practical
zero-knowledge proofs that can withstand quantum attacks by basing them on the hardness of lattice problems.
Lattice problems are a very promising set of assumptions upon which to base cryptography and they
are currently being used to create the most efficient quantum-resistant encryption and signature schemes.
Creating more complex, but still practical, lattice-based schemes has so far proved to be a major challenge
mostly due to the difficulty of constructing efficient zero-knowledge proofs – and this is the problem that the
project proposes to solve.
Champ scientifique
Programme(s)
Régime de financement
ERC-COG - Consolidator GrantInstitution d’accueil
8803 Rueschlikon
Suisse