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

VERICOMP

Financiado

Cerrado

Foundations of Verifiable Computing

Proof systems allow a weak verifier to ascertain the correctness of complex computational statements. Efficiently-verifiable proof systems are fundamental objects in the study of computation, and have led to some of the deepest an... ver más

31/12/2024

WEIZMANN

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

WEIZMANN INSTITUTE OF SCIENCE 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 2024-12-31

ERC-2018-COG: ERC Consolidator Grant

I+D

Cerrada hace 6 años

0% 100% 100%

Información adicional privada

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

2 Participantes

WEIZMANN

1.88M€ | Lider

CITEL SL

497.04K€ | 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

MCT Metacomputational Complexity Theory 213K€ Cerrado

EPRICOT Efficient Proofs and Computation A Unified Algebraic Appro... 2M€ Cerrado

EXT Randomness Extractors Constructions and Applications 1M€ Cerrado

LEAP Local-to-global Expansion and PCPs 2M€ Cerrado

CGinsideNP Complexity Inside NP A Computational Geometry Perspective 1M€ Cerrado

COHOMCODES Robust Codes from Higher Dimesional Expanders 1M€ Cerrado

Duración del proyecto: 72 meses Fecha Inicio: 2018-12-13
Fecha Fin: 2024-12-31

Líder del proyecto

WEIZMANN INSTITUTE OF SCIENCE No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

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

Descripción del proyecto Proof systems allow a weak verifier to ascertain the correctness of complex computational statements. Efficiently-verifiable proof systems are fundamental objects in the study of computation, and have led to some of the deepest and most celebrated insights in cryptography and in complexity theory. The vast and rich literature on proof systems focuses primarily on proving the correctness of intractable statements, e.g. ones that are NP-complete. While the verification can be efficient, the proofs themselves cannot be generated in polynomial time. This limits the applicability of such proof systems, both from a theoretical perspective and in their real-world impact. This proposal aims to obtain a comprehensive understanding of proof systems with polynomial-time proof generation, to explore their practical applicability, and to investigate their connections with foundational questions in cryptography and in complexity theory. Our study will focus primarily on interactive proof systems for tractable computations. The proposed research aims to revolutionize our understanding of these foundational objects by providing a complete and tight characterization of the complexity or proving and verifying general statements, by achieving breakthroughs in the study of related proof system notions, such as cryptographic arguments, and by building a fine-grained algorithmic theory of proof systems for central polynomial-time computational problems. Our research will leverage these advances towards diverse applications: from real-world security challenges, such as verifying the correctness of computations performed by the cloud and cryptographic proofs of work, to a complexity-theoretic understanding of the complexity of approximating problems in P and of solving them on random instances.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores