Hola,
¿eres nuevo aquí?

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

CLC

Financiado

Cryptography with Low Complexity

The efficiency of cryptographic constructions is a fundamental question. Theoretically, it is important to understand how much computational resources are needed to guarantee strong notions of security. Practically, highly efficie... ver más

31/10/2021

TAU

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

TEL AVIV UNIVERSITY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2021-10-31

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

ERC-StG-2014: ERC Starting Grant

I+D

Cerrada hace 10 años

0% 100% 100%

2 Participantes

TAU

1.27M€ | Lider

Geovirtual

464.17K€ | Participante

Últimas noticias

30-11-2024: Cataluña Gestión For... Se ha cerrado la línea de ayuda pública: Gestión Forestal Sostenible para Inversiones Forestales Productivas para el organismo:

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

Duración del proyecto: 78 meses Fecha Inicio: 2015-04-15
Fecha Fin: 2021-10-31

Líder del proyecto

TEL AVIV UNIVERSITY

TRL 4-5

Presupuesto del proyecto 1M€

Descripción del proyecto The efficiency of cryptographic constructions is a fundamental question. Theoretically, it is important to understand how much computational resources are needed to guarantee strong notions of security. Practically, highly efficient schemes are always desirable for real-world applications. More generally, the possibility of cryptography with low complexity has wide applications for problems in computational complexity, combinatorial optimization, and computational learning theory. In this proposal we aim to understand what are the minimal computational resources needed to perform basic cryptographic tasks. In a nutshell, we suggest to focus on three main objectives. First, we would like to get better understanding of the cryptographic hardness of random local functions. Such functions can be computed by highly-efficient circuits and their cryptographic hardness provides a strong and clean formulation for the conjectured average-case hardness of constraint satisfaction problems - a fundamental subject which lies at the core of the theory of computer science. Our second objective is to harness our insights into the hardness of local functions to improve the efficiency of basic cryptographic building blocks such as pseudorandom functions. Finally, our third objective is to expand our theoretical understanding of garbled circuits, study their limitations, and improve their efficiency. The suggested project can bridge across different regions of computer science such as random combinatorial structures, cryptography, and circuit complexity. It is expected to impact central problems in cryptography, while enriching the general landscape of theoretical computer science.

Conecta tu I+D

Entra hoy

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores