Hola,
¿eres nuevo aquí?

Registrate y conecta tu empresa con financiación pública, partners y proyectos.

ReSCALE

Financiado

Reinventing Symmetric Cryptography for Arithmetization over Large fiElds

"Symmetric cryptography is finding new uses because of the emergence of novel and more complex (e.g. distributed) computing environments. These are based on sophisticated zero-knowledge and Multi-Party Computation (MPC) protocols... ver más

31/08/2027

INRIA

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQU... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2022-06-10

Línea de financiación objetivo El proyecto se financió a través de la siguiente ayuda:

ERC-2021-STG: ERC STARTING GRANTS

I+D

Cerrada hace 3 años

0% 100% 100%

1 Participantes

INRIA

1.49M€ | Lider

Proyectos interesantes

PID2019-110873RJ-I00 PROTOCOLOS CRIPTOGRAFICOS SEGUROS PARA ARITMETICA SOBRE ANIL... 182K€ Cerrado

MTM2014-55421-P SECUENCIAS, RETICULAS Y POLINOMIOS EN CRIPTOLOGIA 26K€ Cerrado

MTM2015-69138-REDT MATEMATICAS EN LA SOCIEDAD DE LA INFORMACION 30K€ Cerrado

HSS Homomorphic Secret Sharing Secure Computation and Beyond 1M€ Cerrado

AlmaCrypt Algorithmic and Mathematical Cryptology 2M€ Cerrado

PID2021-124928NB-I00 RETOS EN CODIGOS ALGEBRAICOS Y EN CRIPTOGRAFIA BASADA EN LA... 174K€ Cerrado

Últimas noticias

29-11-2024: IDAE En las últimas 48 horas el Organismo IDAE ha otorgado 4 concesiones

29-11-2024: ECE En las últimas 48 horas el Organismo ECE ha otorgado 2 concesiones

29-11-2024: CMVAMADRID En las últimas 48 horas el Organismo CMVAMADRID ha otorgado 37 concesiones

Duración del proyecto: 62 meses Fecha Inicio: 2022-06-10
Fecha Fin: 2027-08-31

Presupuesto del proyecto 1M€

Descripción del proyecto "Symmetric cryptography is finding new uses because of the emergence of novel and more complex (e.g. distributed) computing environments. These are based on sophisticated zero-knowledge and Multi-Party Computation (MPC) protocols, and they aim to provide strong security guarantees of types that were unthinkable before. In particular, they make it theoretically possible to prove that a computation was done as claimed by those performing it without revealing its inputs or outputs. This would make it possible e.g. for e-governance algorithms to prove that they are run honestly; and overall would increase the trust we can have in various automated processes. The security techniques providing these guarantees are sequences of operations in a large finite field GF(q), where typically q>2^64. However, these procedures also rely on hash functions and other ""symmetric"" cryptographic algorithms that are defined over GF(2}={0,1}. But encoding GF(2) operations using GF(q) operations is very costly: relying on standard hash functions leads to significant performance overhead, to the point were the protocols mentioned before are unusable in practice. In order to alleviate this bottleneck, it is necessary to devise symmetric algorithms that are natively described in GF(q). This change requires great care: some hash functions described in GF(q) have already been presented, and subsequently exhibited significant flaws. The inherent structural differences between GF(2) and GF(q) are the cause behind these problems: our understanding of the construction of symmetric primitives in GF(2) does not carry over to GF(q). With this project, I will bring symmetric cryptography into GF(q) in a safe and efficient way. To this end, I will rebuild the analysis tools and methods that are used both by designers and attackers. This project will naturally lead to the design of new algorithms whose adoption will be simplified by the efficient and easy-to-use software libraries we will provide."

Conecta tu I+D

Entra hoy

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores