Succinct Cryptographic Proof Systems: Theory and Practice

The CRYPTOPROOF project aims to design a new cryptographic proof system that enhances efficiency, soundness, and compilation, surpassing current state-of-the-art implementations.

Subsidie
€ 1.498.819
2024

Projectdetails

Introduction

A proof system allows a powerful prover to convince a weak party (the verifier) of the validity of large computations. Proof systems are a powerful and versatile tool that is central to complexity theory and cryptography. Since their introduction, they have led to breakthroughs such as the celebrated PCP theorem, zero-knowledge proofs, hardness of approximation, and more.

Demand for Practical Implementations

The rise of cloud computing, blockchain technologies, and distributed computing has created a vast demand for practical implementations. Cryptographic proofs leverage the use of cryptographic primitives to gain efficiency benefits, including succinct proofs with fast proving and verifying times, suitable for practical implementations.

Current Applications

These days, cryptographic proof systems maintain the integrity of blockchain networks, securing trillions of dollars in transactions.

Project Goals

The goal of the CRYPTOPROOF project is to advance the efficiency of cryptographic proof systems:

  1. High-soundness: For oracle proofs, the query complexity of the verifier is the main bottleneck towards succinctness. Obtaining proof systems with polynomially small error and constant query complexity would resolve the four-decades-old sliding-scale conjecture and would have significant practical implications.

  2. Improving the compilation efficiency: Cryptographic proof systems are usually obtained by compiling a proof system with several cryptographic primitives, which yields crucial properties such as noninteractivity and succinctness that are required for most applications.

  3. Limitations: Limitations of proof systems and cryptographic proof systems are a scarce resource. They build the boundaries of possibilities and guide us to new constructions.

Conclusion

Beyond the above, the end goal of the CRYPTOPROOF project is to design and implement a new cryptographic proof system with efficiency measures that surpass the current state-of-the-art.

Financiële details & Tijdlijn

Financiële details

Subsidiebedrag€ 1.498.819
Totale projectbegroting€ 1.498.819

Tijdlijn

Startdatum1-10-2024
Einddatum30-9-2029
Subsidiejaar2024

Partners & Locaties

Projectpartners

  • BAR ILAN UNIVERSITYpenvoerder

Land(en)

Israel

Vergelijkbare projecten binnen European Research Council

ERC Starting...

Fast Proofs for Verifying Computations

The FASTPROOF project aims to enhance computational proof-systems by minimizing interaction, reducing proving time to linear complexity, and optimizing memory usage, while relying on cryptographic assumptions.

€ 1.435.000
ERC Starting...

Secrecy-Preserving Proofs with Solid Foundations

The project aims to develop efficient, secrecy-preserving proofs that maintain rigorous cryptographic security for high-stakes and large-scale applications, addressing current and future threats.

€ 1.390.625
ERC Starting...

Cryptographic Foundation for Secure and Scalable Distributed Systems

CRYPTOSYSTEMS aims to enhance the robustness and scalability of distributed systems by developing new formal models and efficient cryptographic algorithms tailored for their unique needs.

€ 1.416.204
ERC Consolid...

Decentralized Cryptographic Systems

This project aims to develop robust cryptographic systems that align theoretical models with real-world challenges, enhancing security and efficiency for decentralized infrastructures.

€ 1.998.351
ERC Advanced...

Local-to-global Expansion and PCPs

This project aims to advance the study of Probabilistically Checkable Proofs using high-dimensional expansion theory to develop simpler PCP constructions and enhance local-to-global encoding understanding.

€ 2.105.840