Foundations of Verifiable Computing

Project Information

VERICOMP

Grant agreement ID: 819702

DOI

10.3030/819702

Project terminated on 16 October 2024

EC signature date 13 December 2018

Start date 1 January 2019

End date 31 December 2024

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 882 460,00

EU contribution

€ 1 882 460,00

Coordinated by

WEIZMANN INSTITUTE OF SCIENCE
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 .

Publications

Book chapters (3)

Batch Verification and Proofs of Proximity with Polylog Overhead

Author(s): Guy N. Rothblum, Ron D. Rothblum
Published in: Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II, Issue 12551, 2020, Page(s) 108-138, ISBN 978-3-030-64377-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-64378-2_5

Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions

Author(s): Noga Amit, Guy N. Rothblum
Published in: Lecture Notes in Computer Science, Advances in Cryptology – CRYPTO 2024, 2024, Page(s) 3-37
Publisher: Springer Nature Switzerland
DOI: 10.1007/978-3-031-68403-6_1

Batch Verification for Statistical Zero Knowledge Proofs

Author(s): Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
Published in: Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II, Issue 12551, 2020, Page(s) 139-167, ISBN 978-3-030-64377-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-64378-2_6

Conference proceedings (25)

Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost

Author(s): Lijie Chen, Roei Tell
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2023, Page(s) 283-291
Publisher: ACM
DOI: 10.1145/3406325.3451059

Verifying the unseen: interactive proofs for label-invariant distribution properties

Author(s): Tal Herman, Guy N. Rothblum
Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2023, Page(s) 1208-1219
Publisher: ACM
DOI: 10.1145/3519935.3519987

Doubley-Efficient Interactive Proofs for Distribution Properties

Author(s): Tal Herman, Guy Rothblum
Published in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 743-751
Publisher: IEEE
DOI: 10.1109/focs57990.2023.00049

Sample-Based Proofs of Proximity

Author(s): Guy Goldberg, Guy N. Rothblum
Published in: 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022, Page(s) 77:1--77:19, ISBN 978-3-95977-217-4
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2022.77

Randomness Extraction from Somewhat Dependent Sources

Author(s): Marshall Ball, Oded Goldreich, Tal Malkin
Published in: 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022, Page(s) 12:1--12:14, ISBN 978-3-95977-217-4
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2022.12

Decision-Making under Miscalibration

Author(s): Rothblum, Guy N.; Yona, Gal
Published in: Issue 14, 2023
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.itcs.2023.92

From the Real Towards the Ideal: Risk Prediction in a Better World

Author(s): Dwork, Cynthia; Reingold, Omer; Rothblum, Guy N.
Published in: Symposium on Foundations of Responsible Computing, Issue 1, 2023
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.forc.2023.1

Outcome indistinguishability

Author(s): Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Page(s) 1095-1108, ISBN 9781450380539
Publisher: ACM
DOI: 10.1145/3406325.3451064

Constant-Round Arguments from One-Way Functions

Author(s): Noga Amit, Guy N. Rothblum
Published in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Page(s) 1537-1544
Publisher: ACM
DOI: 10.1145/3564246.3585244

Multi-group Agnostic {PAC} Learnability

Author(s): Guy N. Rothblum, Gal Yona
Published in: Proceedings of the 38th International Conference on Machine Learning (ICML) 2021, Issue 18-24 July 2021, 2021, Page(s) 9107--9115
Publisher: PMLR

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing

Author(s): Oded Goldreich, Avi Wigderson
Published in: 36th Computational Complexity Conference, {CCC} 2021, Issue July 20-23, 2021, 2021, Page(s) 12:1--12:74
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.ccc.2021.12

Fiat-Shamir: from practice to theory

Author(s): Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 1082-1090, ISBN 9781-450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316380

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir

Author(s): Arka Rai Choudhuri, Pavel Hubáček, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 1103-1114, ISBN 9781-450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316400

Incrementally Verifiable Computation via Incremental PCPs

Author(s): Moni Naor, Omer Paneth, Guy N. Rothblum
Published in: Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II, Issue 11892, 2019, Page(s) 552-576, ISBN 978-3-030-36032-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-36033-7_21

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Author(s): Gal Arnon, Guy N. Rothblum
Published in: 2nd Conference on Information-Theoretic Cryptography (ITC 2021), 2021, Page(s) 3:1–3:15, ISBN 978-3-95977-197-9
Publisher: LIPIcs - Leibniz International Proceedings in Informatics
DOI: 10.4230/lipics.itc.2021.3

Interactive Proofs for Verifying Machine Learning

Author(s): Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff
Published in: 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021, Page(s) 41:1--41:19
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.itcs.2021.41

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract

Author(s): Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 13-23, ISBN 978-1-7281-9621-3
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00010

On Hitting-Set Generators for Polynomials that Vanish Rarely

Author(s): Dean Doron, Amnon Ta-Shma, Roei Tell
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2020, 2020
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Learning from Outcomes: Evidence-Based Rankings

Author(s): Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Page(s) 106-125, ISBN 978-1-7281-4952-3
Publisher: IEEE
DOI: 10.1109/focs.2019.00016

Abstracting Fairness: Oracles, Metrics, and Interpretability

Author(s): Dwork, Cynthia; Ilvento, Christina; Rothblum, Guy N.; Sur, Pragya
Published in: 1st Symposium on Foundations of Responsible Computing, {FORC} 2020, 2020
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.forc.2020.8

Communication Complexity with Defective Randomness

Author(s): Marshall Ball, Oded Goldreich, Tal Malkin
Published in: 36th Computational Complexity Conference, {CCC} 2021, Issue July 20-23, 2021, 2021, Page(s) 14:1--14:10
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.ccc.2021.14

On Interactive Proofs of Proximity with Proof-Oblivious Queries

Author(s): Goldreich, Oded; Rothblum, Guy N.; Skverer, Tal
Published in: Innovations in Theoretical Computer Science Conference, {ITCS}, Issue 1, 2023
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.itcs.2023.59

Testing Distributions of Huge Objects

Author(s): Oded Goldreich, Dana Ron
Published in: 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022, Page(s) 78:1--78:19, ISBN 978-3-95977-217-4
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2022.78

On Fairness and Stability in Two-Sided Matchings

Author(s): Gili Karni, Guy N. Rothblum, Gal Yona
Published in: 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022, Page(s) 92:1--92:17, ISBN 978-3-95977-217-4
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2022.92

Interactive Proofs for General Distribution Properties

Author(s): Tal Herman, Guy Rothblum
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 528-538
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00041

Other (6)

A tight bound for the clique query problem in two rounds

Author(s): Uriel Feige, Tom Ferster
Published in: Arxiv, 2021
Publisher: Arxiv

A Lower Bound on the Complexity of Testing Grained Distributions

Author(s): Oded Goldreich , Dana Ron
Published in: Electronic Colloquium on Computational Complexity (ECCC), 2021
Publisher: Electronic Colloquium on Computational Complexity (ECCC)

Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model

Author(s): Goldreich, Oded
Published in: 2019
Publisher: arXiv

On the Complexity of Estimating the Effective Support Size

Author(s): Oded Goldreich
Published in: Electronic Colloquium on Computational Complexity {(ECCC)}, 2019
Publisher: Electronic Colloquium on Computational Complexity {(ECCC)}

CHIP and CRISP: Protecting All Parties Against Compromise through Identity-Binding PAKEs

Author(s): Cas Cremers, Moni Naor, Shahar Paz, Eyal Ronen
Published in: 2020
Publisher: {IACR} Cryptol. ePrint Arch.

A tight bound for the clique query problem in two rounds

Author(s): Feige, Uriel; Ferster, Tom
Published in: CoRR, 2021, ISSN 2331-8422
Publisher: ArXiv

Peer reviewed articles (2)

Proving that prBPP = prP is as hard as proving that “almost NP” is not contained in P/poly

Author(s): Roei Tell
Published in: Information Processing Letters, Issue 152, 2019, Page(s) 105841, ISSN 0020-0190
Publisher: Elsevier BV
DOI: 10.1016/j.ipl.2019.105841

Good permutation codes based on the shuffle-exchange network

Author(s): Oded Goldreich, Avi Wigderson
Published in: Israel Journal of Mathematics, Issue 256, 2023, Page(s) 283-296, ISSN 0021-2172
Publisher: Magnes Press
DOI: 10.1007/s11856-023-2498-4

Non-peer reviewed articles (3)

Local Algorithms for Sparse Spanning Graphs

Author(s): Reut Levi, Dana Ron, Ronitt Rubinfeld
Published in: Algorithmica, Issue 82/4, 2020, Page(s) 747-786, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-019-00612-6

Testing Bounded Arboricity

Author(s): Talya Eden, Reut Levi, Dana Ron
Published in: ACM Transactions on Algorithms, Issue 16/2, 2020, Page(s) 1-22, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3381418

Property testing of planarity in the CONGEST model

Author(s): Reut Levi, Moti Medina, Dana Ron
Published in: Distributed Computing, 2020, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-020-00382-3