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.
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:
-
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.
-
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.
-
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
Startdatum | 1-10-2024 |
Einddatum | 30-9-2029 |
Subsidiejaar | 2024 |
Partners & Locaties
Projectpartners
- BAR ILAN UNIVERSITYpenvoerder
Land(en)
Vergelijkbare projecten binnen European Research Council
Project | Regeling | Bedrag | Jaar | Actie |
---|---|---|---|---|
Fast Proofs for Verifying ComputationsThe 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. | ERC Starting... | € 1.435.000 | 2022 | Details |
Secrecy-Preserving Proofs with Solid FoundationsThe 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. | ERC Starting... | € 1.390.625 | 2022 | Details |
Cryptographic Foundation for Secure and Scalable Distributed SystemsCRYPTOSYSTEMS aims to enhance the robustness and scalability of distributed systems by developing new formal models and efficient cryptographic algorithms tailored for their unique needs. | ERC Starting... | € 1.416.204 | 2023 | Details |
Decentralized Cryptographic SystemsThis project aims to develop robust cryptographic systems that align theoretical models with real-world challenges, enhancing security and efficiency for decentralized infrastructures. | ERC Consolid... | € 1.998.351 | 2024 | Details |
Local-to-global Expansion and PCPsThis 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. | ERC Advanced... | € 2.105.840 | 2025 | Details |
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.
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.
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.
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.
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.