Fast Proofs for Verifying Computations

Project Information

FASTPROOF

Grant agreement ID: 101041208

DOI

10.3030/101041208

EC signature date 1 March 2022

Start date 1 April 2022

End date 31 March 2027

Funded under

• European Research Council (ERC)

Total cost

€ 1 435 000,00

EU contribution

€ 1 435 000,00

Coordinated by

TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY
Israel

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Deliverables

Documents, reports (1)

Data Management Plan

Drafting of Data Management Plan

Publications

Conference proceedings (16)

Distribution-Free Proofs of Proximity

Author(s): Gur, Tom; Aaronson, Hugo; Rajgopal, Ninad; Rothblum, Ron
Published in: 2023
Publisher: CCC 2024
DOI: 10.48550/arxiv.2308.08874

Locally Testable Tree Codes

Author(s): Tamer Moud, Alon Rosen, Ron Rothblum
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.189

Combinatorially Homomorphic Encryption

Author(s): Yuval Ishai, Eyal Kushnir, and Ron D. Rothblum
Published in: Cryptology ePrint Archive, Issue 2023/1973, 2023, ISBN 978-3-031-48617-3
Publisher: Springer
DOI: 10.1007/978-3-031-48618-0_9

Collision-Resistance from Multi-Collision-Resistance

Author(s): Ron D. Rothblum Prashant Nalini Vasudevan
Published in: Journal of Cryptology, 2022, ISBN 978-3-031-15981-7
Publisher: Springer
DOI: 10.1007/978-3-031-15982-4_17

Efficient Interactive Proofs for Non-Deterministic Bounded Space

Author(s): Joshua Cook, Ron D. Rothblum
Published in: Electronic colloquium on computational complexity, 2023, ISSN 1868-8969
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f""ur Informatik"
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2023.47

Rate-1 Zero-Knowledge Proofs from One-Way Functions

Author(s): Noor Athamnah, Eden Florentz – Konopnicki, Ron D. Rothblum
Published in: Lecture Notes in Computer Science, Theory of Cryptography, 2024
Publisher: ACM
DOI: 10.1007/978-3-031-78011-0_11

Unstructured Hardness to Average-Case Randomness

Author(s): Lijie Chen, Ron D. Rothblum, Roei Tell
Published in: Annual IEEE Symposium on Foundations of Computer Science, 2022
Publisher: IEEE Computer Society
DOI: 10.1109/FOCS54457.2022.00048

Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?)

Author(s): Lijie Chen, Ron D. Rothblum, Roei Tell
Published in: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
Publisher: ACM
DOI: 10.1145/3717823.3718177

Proving as fast as computing: succinct arguments with constant prover overhead

Author(s): Noga Ron-Zewi, Ron D. Rothblum
Published in: Cryptology ePrint Archive, Issue 2021/1673, 2022, ISBN 9781450392648
Publisher: Association for Computing Machinery
DOI: 10.1145/3519935.3519956

Faithful Simulation of Randomized BFT Protocols on Block DAGs

Author(s): Attiya, Hagit; Enea, Constantin; Nassar, Shafik
Published in: 34th International Conference on Concurrency Theory, {CONCUR} 2023,, 2023
Publisher: Concur 2023

Delegation for Search Problems

Author(s): Justin Holmgren, Andrea Lincoln, Ron D. Rothblum
Published in: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), 2022, ISSN 1868-8969
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f""ur Informatik"
DOI: 10.4230/LIPIcs.ICALP.2022.73

Batch Proofs Are Statistically Hiding

Author(s): Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan
Published in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2025
Publisher: ACM
DOI: 10.1145/3618260.3649775

Doubly-Efficient Batch Verification in Statistical Zero-Knowledge

Author(s): Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan
Published in: Lecture Notes in Computer Science, Theory of Cryptography, 2024
Publisher: ACM
DOI: 10.1007/978-3-031-78017-2_13

Faster Sounder Succinct Arguments and s

Author(s): Justin Holmgren, Ron D. Rothblum
Published in: Cryptology ePrint Archive, 2022, ISBN 978-3-031-15801-8
Publisher: Springer

Succinct Interactive Oracle Proofs: Applications and Limitations

Author(s): Shafik Nassar, Ron D. Rothblum
Published in: Cryptology Eprint Archive, Issue 2022/281, 2022, ISBN 978-3-031-15801-8
Publisher: Springer
DOI: 10.1007/978-3-031-15802-5_18

Strong Batching for Non-interactive Statistical Zero-Knowledge

Author(s): Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan
Published in: Lecture Notes in Computer Science, Advances in Cryptology – EUROCRYPT 2024, 2024
Publisher: Springer
DOI: 10.1007/978-3-031-58751-1_9