Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

FOC

Financiado

Cerrado

Foundations of Cryptographic Hardness

A fundamental research challenge in modern cryptography is understanding the necessary hardness assumptions required to build different cryptographic primitives. Attempts to answer this question have gained tremendous success in t... ver más

28/02/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

Fecha límite participación Sin fecha límite de participación.

Ver 2 Participantes

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

ERC-StG-2014: ERC Starting Grant

I+D

Cerrada hace 10 años

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

2 Participantes

TAU

1.24M€ | Lider

MONDRAGON ASSEMBLY

349.26K€ | Participante

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

SymTrust Trust-by-Design – Strong Security Arguments for Symmetric Ke... 2M€ Cerrado

HECTOR HARDWARE ENABLED CRYPTO AND RANDOMNESS 4M€ Cerrado

RAC Randomness and Computation 1M€ Cerrado

ESCADA Energy optimized Symmetric Cryptography by Algebraic Duality... 3M€ Cerrado

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

FGC Fine Grained Cryptography 2M€ Cerrado

Duración del proyecto: 72 meses Fecha Inicio: 2015-02-26
Fecha Fin: 2021-02-28

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

Presupuesto del proyecto 1M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto A fundamental research challenge in modern cryptography is understanding the necessary hardness assumptions required to build different cryptographic primitives. Attempts to answer this question have gained tremendous success in the last 20-30 years. Most notably, it was shown that many highly complicated primitives can be based on the mere existence of one-way functions (i.e., easy to compute and hard to invert), while other primitives cannot be based on such functions. This research has yielded fundamental tools and concepts such as randomness extractors and computational notions of entropy. Yet many of the most fundamental questions remain unanswered. Our first goal is to answer the fundamental question of whether cryptography can be based on the assumption that P not equal NP. Our second and third goals are to build a more efficient symmetric-key cryptographic primitives from one-way functions, and to establish effective methods for security amplification of cryptographic primitives. Succeeding in the second and last goals is likely to have great bearing on the way that we construct the very basic cryptographic primitives. A positive answer for the first question will be considered a dramatic result in the cryptography and computational complexity communities. To address these goals, it is very useful to understand the relationship between different types and quantities of cryptographic hardness. Such understanding typically involves defining and manipulating different types of computational entropy, and comprehending the power of security reductions. We believe that this research will yield new concepts and techniques, with ramification beyond the realm of foundational cryptography.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores