All reports by Author Noga Amit:

__
TR24-098
| 26th May 2024
__

Noga Amit, Orr Paradise, Guy Rothblum, shafi goldwasser#### Models That Prove Their Own Correctness

Revisions: 2

__
TR24-096
| 27th May 2024
__

Noga Amit, Guy Rothblum#### Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions

Revisions: 2

__
TR23-081
| 1st June 2023
__

Noga Amit, Guy Rothblum#### Constant-Round Arguments from One-Way Functions

Revisions: 1

Noga Amit, Orr Paradise, Guy Rothblum, shafi goldwasser

How can we trust the correctness of a learned model on a particular input of interest? Model accuracy is typically measured $on\ average$ over a distribution of inputs, giving no guarantee for any fixed input. This paper proposes a theoretically-founded solution to this problem: to train $Self$-$Proving\ models$ that prove ... more >>>

Noga Amit, Guy Rothblum

What are the minimal cryptographic assumptions that suffice for constructing efficient argument systems, and for which tasks? Recently, Amit and Rothblum [STOC 2023] showed that one-way functions suffice for constructing constant-round arguments for bounded-depth computations. In this work we ask: what other tasks have efficient argument systems based only on ... more >>>

Noga Amit, Guy Rothblum

We study the following question: what cryptographic assumptions are needed for obtaining constant-round computationally-sound argument systems? We focus on argument systems with almost-linear verification time for subclasses of $\mathbf{P}$, such as depth-bounded computations.

Kilian's celebrated work [STOC 1992] provides such 4-message arguments for $\mathbf{P}$ (actually, for $\mathbf{NP}$) using collision-resistant hash ...
more >>>