Foundations of Verifiable Computing

Información del proyecto

VERICOMP

Identificador del acuerdo de subvención: 819702

DOI

10.3030/819702

Proyecto finalizado el 16 Octubre 2024

Fecha de la firma de la CE 13 Diciembre 2018

Fecha de inicio 1 Enero 2019

Fecha de finalización 31 Diciembre 2024

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 882 460,00

Aportación de la UE

€ 1 882 460,00

Coordinado por

WEIZMANN INSTITUTE OF SCIENCE
Israel

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Book chapters (3)

Batch Verification and Proofs of Proximity with Polylog Overhead

Autores: Guy N. Rothblum, Ron D. Rothblum
Publicado en: Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II, Edición 12551, 2020, Página(s) 108-138, ISBN 978-3-030-64377-5
Editor: 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

Autores: Noga Amit, Guy N. Rothblum
Publicado en: Lecture Notes in Computer Science, Advances in Cryptology – CRYPTO 2024, 2024, Página(s) 3-37
Editor: Springer Nature Switzerland
DOI: 10.1007/978-3-031-68403-6_1

Batch Verification for Statistical Zero Knowledge Proofs

Autores: Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
Publicado en: Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II, Edición 12551, 2020, Página(s) 139-167, ISBN 978-3-030-64377-5
Editor: 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

Autores: Lijie Chen, Roei Tell
Publicado en: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2023, Página(s) 283-291
Editor: ACM
DOI: 10.1145/3406325.3451059

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

Autores: Tal Herman, Guy N. Rothblum
Publicado en: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2023, Página(s) 1208-1219
Editor: ACM
DOI: 10.1145/3519935.3519987

Doubley-Efficient Interactive Proofs for Distribution Properties

Autores: Tal Herman, Guy Rothblum
Publicado en: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 743-751
Editor: IEEE
DOI: 10.1109/focs57990.2023.00049

Sample-Based Proofs of Proximity

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

Randomness Extraction from Somewhat Dependent Sources

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

Decision-Making under Miscalibration

Autores: Rothblum, Guy N.; Yona, Gal
Publicado en: Edición 14, 2023
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.itcs.2023.92

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

Autores: Dwork, Cynthia; Reingold, Omer; Rothblum, Guy N.
Publicado en: Symposium on Foundations of Responsible Computing, Edición 1, 2023
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.forc.2023.1

Outcome indistinguishability

Autores: Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
Publicado en: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Página(s) 1095-1108, ISBN 9781450380539
Editor: ACM
DOI: 10.1145/3406325.3451064

Constant-Round Arguments from One-Way Functions

Autores: Noga Amit, Guy N. Rothblum
Publicado en: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Página(s) 1537-1544
Editor: ACM
DOI: 10.1145/3564246.3585244

Multi-group Agnostic {PAC} Learnability

Autores: Guy N. Rothblum, Gal Yona
Publicado en: Proceedings of the 38th International Conference on Machine Learning (ICML) 2021, Edición 18-24 July 2021, 2021, Página(s) 9107--9115
Editor: PMLR

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

Autores: Oded Goldreich, Avi Wigderson
Publicado en: 36th Computational Complexity Conference, {CCC} 2021, Edición July 20-23, 2021, 2021, Página(s) 12:1--12:74
Editor: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.ccc.2021.12

Fiat-Shamir: from practice to theory

Autores: Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs
Publicado en: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Página(s) 1082-1090, ISBN 9781-450367059
Editor: ACM Press
DOI: 10.1145/3313276.3316380

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

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

Incrementally Verifiable Computation via Incremental PCPs

Autores: Moni Naor, Omer Paneth, Guy N. Rothblum
Publicado en: Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II, Edición 11892, 2019, Página(s) 552-576, ISBN 978-3-030-36032-0
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-36033-7_21

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Autores: Gal Arnon, Guy N. Rothblum
Publicado en: 2nd Conference on Information-Theoretic Cryptography (ITC 2021), 2021, Página(s) 3:1–3:15, ISBN 978-3-95977-197-9
Editor: LIPIcs - Leibniz International Proceedings in Informatics
DOI: 10.4230/lipics.itc.2021.3

Interactive Proofs for Verifying Machine Learning

Autores: Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff
Publicado en: 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021, Página(s) 41:1--41:19
Editor: "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

Autores: Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
Publicado en: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Página(s) 13-23, ISBN 978-1-7281-9621-3
Editor: IEEE
DOI: 10.1109/focs46700.2020.00010

On Hitting-Set Generators for Polynomials that Vanish Rarely

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

Learning from Outcomes: Evidence-Based Rankings

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

Abstracting Fairness: Oracles, Metrics, and Interpretability

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

Communication Complexity with Defective Randomness

Autores: Marshall Ball, Oded Goldreich, Tal Malkin
Publicado en: 36th Computational Complexity Conference, {CCC} 2021, Edición July 20-23, 2021, 2021, Página(s) 14:1--14:10
Editor: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.ccc.2021.14

On Interactive Proofs of Proximity with Proof-Oblivious Queries

Autores: Goldreich, Oded; Rothblum, Guy N.; Skverer, Tal
Publicado en: Innovations in Theoretical Computer Science Conference, {ITCS}, Edición 1, 2023
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.itcs.2023.59

Testing Distributions of Huge Objects

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

On Fairness and Stability in Two-Sided Matchings

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

Interactive Proofs for General Distribution Properties

Autores: Tal Herman, Guy Rothblum
Publicado en: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Página(s) 528-538
Editor: IEEE
DOI: 10.1109/focs61266.2024.00041

Other (6)

A tight bound for the clique query problem in two rounds

Autores: Uriel Feige, Tom Ferster
Publicado en: Arxiv, 2021
Editor: Arxiv

A Lower Bound on the Complexity of Testing Grained Distributions

Autores: Oded Goldreich , Dana Ron
Publicado en: Electronic Colloquium on Computational Complexity (ECCC), 2021
Editor: Electronic Colloquium on Computational Complexity (ECCC)

Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model

Autores: Goldreich, Oded
Publicado en: 2019
Editor: arXiv

On the Complexity of Estimating the Effective Support Size

Autores: Oded Goldreich
Publicado en: Electronic Colloquium on Computational Complexity {(ECCC)}, 2019
Editor: Electronic Colloquium on Computational Complexity {(ECCC)}

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

Autores: Cas Cremers, Moni Naor, Shahar Paz, Eyal Ronen
Publicado en: 2020
Editor: {IACR} Cryptol. ePrint Arch.

A tight bound for the clique query problem in two rounds

Autores: Feige, Uriel; Ferster, Tom
Publicado en: CoRR, 2021, ISSN 2331-8422
Editor: ArXiv

Peer reviewed articles (2)

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

Autores: Roei Tell
Publicado en: Information Processing Letters, Edición 152, 2019, Página(s) 105841, ISSN 0020-0190
Editor: Elsevier BV
DOI: 10.1016/j.ipl.2019.105841

Good permutation codes based on the shuffle-exchange network

Autores: Oded Goldreich, Avi Wigderson
Publicado en: Israel Journal of Mathematics, Edición 256, 2023, Página(s) 283-296, ISSN 0021-2172
Editor: Magnes Press
DOI: 10.1007/s11856-023-2498-4

Non-peer reviewed articles (3)

Local Algorithms for Sparse Spanning Graphs

Autores: Reut Levi, Dana Ron, Ronitt Rubinfeld
Publicado en: Algorithmica, Edición 82/4, 2020, Página(s) 747-786, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-019-00612-6

Testing Bounded Arboricity

Autores: Talya Eden, Reut Levi, Dana Ron
Publicado en: ACM Transactions on Algorithms, Edición 16/2, 2020, Página(s) 1-22, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3381418

Property testing of planarity in the CONGEST model

Autores: Reut Levi, Moti Medina, Dana Ron
Publicado en: Distributed Computing, 2020, ISSN 0178-2770
Editor: Springer Verlag
DOI: 10.1007/s00446-020-00382-3