Foundations of Verifiable Computing

Informazioni relative al progetto

VERICOMP

ID dell’accordo di sovvenzione: 819702

DOI

10.3030/819702

Progetto concluso il 16 Ottobre 2024

Data della firma CE 13 Dicembre 2018

Data di avvio 1 Gennaio 2019

Data di completamento 31 Dicembre 2024

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 882 460,00

Contributo UE

€ 1 882 460,00

Coordinato da

WEIZMANN INSTITUTE OF SCIENCE
Israel

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Book chapters (3)

Batch Verification and Proofs of Proximity with Polylog Overhead

Autori: Guy N. Rothblum, Ron D. Rothblum
Pubblicato in: Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II, Numero 12551, 2020, Pagina/e 108-138, ISBN 978-3-030-64377-5
Editore: 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

Autori: Noga Amit, Guy N. Rothblum
Pubblicato in: Lecture Notes in Computer Science, Advances in Cryptology – CRYPTO 2024, 2024, Pagina/e 3-37
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-68403-6_1

Batch Verification for Statistical Zero Knowledge Proofs

Autori: Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
Pubblicato in: Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II, Numero 12551, 2020, Pagina/e 139-167, ISBN 978-3-030-64377-5
Editore: 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

Autori: Lijie Chen, Roei Tell
Pubblicato in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2023, Pagina/e 283-291
Editore: ACM
DOI: 10.1145/3406325.3451059

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

Autori: Tal Herman, Guy N. Rothblum
Pubblicato in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2023, Pagina/e 1208-1219
Editore: ACM
DOI: 10.1145/3519935.3519987

Doubley-Efficient Interactive Proofs for Distribution Properties

Autori: Tal Herman, Guy Rothblum
Pubblicato in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 743-751
Editore: IEEE
DOI: 10.1109/focs57990.2023.00049

Sample-Based Proofs of Proximity

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

Randomness Extraction from Somewhat Dependent Sources

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

Decision-Making under Miscalibration

Autori: Rothblum, Guy N.; Yona, Gal
Pubblicato in: Numero 14, 2023
Editore: Schloss Dagstuhl
DOI: 10.4230/lipics.itcs.2023.92

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

Autori: Dwork, Cynthia; Reingold, Omer; Rothblum, Guy N.
Pubblicato in: Symposium on Foundations of Responsible Computing, Numero 1, 2023
Editore: Schloss Dagstuhl
DOI: 10.4230/lipics.forc.2023.1

Outcome indistinguishability

Autori: Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
Pubblicato in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Pagina/e 1095-1108, ISBN 9781450380539
Editore: ACM
DOI: 10.1145/3406325.3451064

Constant-Round Arguments from One-Way Functions

Autori: Noga Amit, Guy N. Rothblum
Pubblicato in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Pagina/e 1537-1544
Editore: ACM
DOI: 10.1145/3564246.3585244

Multi-group Agnostic {PAC} Learnability

Autori: Guy N. Rothblum, Gal Yona
Pubblicato in: Proceedings of the 38th International Conference on Machine Learning (ICML) 2021, Numero 18-24 July 2021, 2021, Pagina/e 9107--9115
Editore: PMLR

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

Autori: Oded Goldreich, Avi Wigderson
Pubblicato in: 36th Computational Complexity Conference, {CCC} 2021, Numero July 20-23, 2021, 2021, Pagina/e 12:1--12:74
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.ccc.2021.12

Fiat-Shamir: from practice to theory

Autori: Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs
Pubblicato in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Pagina/e 1082-1090, ISBN 9781-450367059
Editore: ACM Press
DOI: 10.1145/3313276.3316380

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

Autori: Arka Rai Choudhuri, Pavel Hubáček, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
Pubblicato in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Pagina/e 1103-1114, ISBN 9781-450367059
Editore: ACM Press
DOI: 10.1145/3313276.3316400

Incrementally Verifiable Computation via Incremental PCPs

Autori: Moni Naor, Omer Paneth, Guy N. Rothblum
Pubblicato in: Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II, Numero 11892, 2019, Pagina/e 552-576, ISBN 978-3-030-36032-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-36033-7_21

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

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

Interactive Proofs for Verifying Machine Learning

Autori: Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff
Pubblicato in: 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021, Pagina/e 41:1--41:19
Editore: "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

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

On Hitting-Set Generators for Polynomials that Vanish Rarely

Autori: Dean Doron, Amnon Ta-Shma, Roei Tell
Pubblicato in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2020, 2020
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"

Learning from Outcomes: Evidence-Based Rankings

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

Abstracting Fairness: Oracles, Metrics, and Interpretability

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

Communication Complexity with Defective Randomness

Autori: Marshall Ball, Oded Goldreich, Tal Malkin
Pubblicato in: 36th Computational Complexity Conference, {CCC} 2021, Numero July 20-23, 2021, 2021, Pagina/e 14:1--14:10
Editore: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.ccc.2021.14

On Interactive Proofs of Proximity with Proof-Oblivious Queries

Autori: Goldreich, Oded; Rothblum, Guy N.; Skverer, Tal
Pubblicato in: Innovations in Theoretical Computer Science Conference, {ITCS}, Numero 1, 2023
Editore: Schloss Dagstuhl
DOI: 10.4230/lipics.itcs.2023.59

Testing Distributions of Huge Objects

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

On Fairness and Stability in Two-Sided Matchings

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

Interactive Proofs for General Distribution Properties

Autori: Tal Herman, Guy Rothblum
Pubblicato in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 528-538
Editore: IEEE
DOI: 10.1109/focs61266.2024.00041

Other (6)

A tight bound for the clique query problem in two rounds

Autori: Uriel Feige, Tom Ferster
Pubblicato in: Arxiv, 2021
Editore: Arxiv

A Lower Bound on the Complexity of Testing Grained Distributions

Autori: Oded Goldreich , Dana Ron
Pubblicato in: Electronic Colloquium on Computational Complexity (ECCC), 2021
Editore: Electronic Colloquium on Computational Complexity (ECCC)

Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model

Autori: Goldreich, Oded
Pubblicato in: 2019
Editore: arXiv

On the Complexity of Estimating the Effective Support Size

Autori: Oded Goldreich
Pubblicato in: Electronic Colloquium on Computational Complexity {(ECCC)}, 2019
Editore: Electronic Colloquium on Computational Complexity {(ECCC)}

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

Autori: Cas Cremers, Moni Naor, Shahar Paz, Eyal Ronen
Pubblicato in: 2020
Editore: {IACR} Cryptol. ePrint Arch.

A tight bound for the clique query problem in two rounds

Autori: Feige, Uriel; Ferster, Tom
Pubblicato in: CoRR, 2021, ISSN 2331-8422
Editore: ArXiv

Peer reviewed articles (2)

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

Autori: Roei Tell
Pubblicato in: Information Processing Letters, Numero 152, 2019, Pagina/e 105841, ISSN 0020-0190
Editore: Elsevier BV
DOI: 10.1016/j.ipl.2019.105841

Good permutation codes based on the shuffle-exchange network

Autori: Oded Goldreich, Avi Wigderson
Pubblicato in: Israel Journal of Mathematics, Numero 256, 2023, Pagina/e 283-296, ISSN 0021-2172
Editore: Magnes Press
DOI: 10.1007/s11856-023-2498-4

Non-peer reviewed articles (3)

Local Algorithms for Sparse Spanning Graphs

Autori: Reut Levi, Dana Ron, Ronitt Rubinfeld
Pubblicato in: Algorithmica, Numero 82/4, 2020, Pagina/e 747-786, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-019-00612-6

Testing Bounded Arboricity

Autori: Talya Eden, Reut Levi, Dana Ron
Pubblicato in: ACM Transactions on Algorithms, Numero 16/2, 2020, Pagina/e 1-22, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3381418

Property testing of planarity in the CONGEST model

Autori: Reut Levi, Moti Medina, Dana Ron
Pubblicato in: Distributed Computing, 2020, ISSN 0178-2770
Editore: Springer Verlag
DOI: 10.1007/s00446-020-00382-3