Foundations of Verifiable Computing
Ended · Israel
Source: EU Funding & Tenders Portal
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 intract
- Status
- Closed
- Sector
- Commercial
- Location
- Israel
- Updated
- 22 Jul 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Foundations of Verifiable Computing
Pick a question to edit it, or write your own.
First answer free · no account
Project Information FAQ
Project Information
Participants
| Not available for this record. |
Status
Original status | ended |
Taiyo status | Closed |
Taiyo last update | 2026-07-22 |
Contact
| Not available for this record. |
Description
Description | 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. |
Location
Country | Israel |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Sector | Commercial |
Article published date | 2025-11-01 |
Research
Free account
View all details
You are reading the public part. A free account opens the rest:
- Every detail on this project
- News and media coverage
- Technical research
Free account · no card · lands you back on this project
More Commercial projects in Israel
- NEW THERMAL STORAGE MANUFACTURING PLANT (EDP)
- NEGEV SOLAR THERMAL PLANT
- Tzafit GasFired Power Plant
- MEGALIM SOLAR THERMAL PLANT
- Mediterranean Technology Led Incubator Co-Operation
- Cost-effective rehabilitation of public buildings into smart and resilient nano-grids using storage
- New Performances for Mediterranean Tourism
- V house / Blatman Cohen architecture design
