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

NFITSC

Financiado

Cerrado

New Frontiers in Information-Theoretic Secure Computation

Information-theoretic secure computation is a general-purpose technique for processing sensitive data without compromising its confidentiality or integrity even in the presence of a computationally-unbounded all-powerful adversary... ver más

30/04/2028

TAU

2M€

Presupuesto del proyecto: 2M€

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.

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2023-05-01

ERC-2022-ADG: ERC ADVANCED GRANTS Scope:Objectives

I+D

Cerrada hace 2 años

0% 100%

Información adicional privada

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

Participantes

TAU

Lider

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

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

OBELiSC Overcoming Barriers and Efficiency Limitations in Secure Com... 2M€ Cerrado

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

PID2019-110525GB-I00 METODOS ALGEBRAICOS Y HEURISTICOS EN TEORIA DE CODIGOS Y CRI... 37K€ Cerrado

SCALE Privacy-Preserving Large-Scale Computation: Foundations and... 1M€ Cerrado

ReSCALE Reinventing Symmetric Cryptography for Arithmetization over... 1M€ Cerrado

Duración del proyecto: 59 meses Fecha Inicio: 2023-05-01
Fecha Fin: 2028-04-30

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 2M€

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

Descripción del proyecto Information-theoretic secure computation is a general-purpose technique for processing sensitive data without compromising its confidentiality or integrity even in the presence of a computationally-unbounded all-powerful adversary. This notion plays an important role in cryptography, both as a stand-alone object and as a tool for computational constructs. Despite its increasing importance, we have a very limited understanding of the *intrinsic complexity* of information-theoretic security, and some of the most central feasibility questions in this area have remained open for more than three decades.In this proposal, we aim to decipher the power and limitations of this notion. We will focus on three main objectives. First, we aim to improve the complexity of general *secret sharing schemes* and exploit such improvements towards realizing highly-efficient general-purpose zero-knowledge proofs. The second objective is to explore the complexity of Secure Non-Interactive Reductions and Multiparty Randomized Encoding -- a powerful generalization of information-theoretic garbled circuits that was recently presented by the PI. The third objective is to expand our theoretical understanding of constant-round information-theoretic protocols, optimize their round complexity, and study their concrete and asymptotic computational complexity.Being part of several recent exciting developments in these areas, we believe that it is now possible to make progress in some of these basic open problems. The suggested research will bridge across different regions of computer science such as coding theory, cryptography, and computational 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

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores