Sept. 18, 2023, 7:18 a.m. |


ePrint Report: Incrementally Verifiable Computation via Rate-1 Batch Arguments

Omer Paneth, Rafael Pass

Non-interactive delegation schemes enable producing succinct proofs (that can be efficiently verified) that a machine $M$ transitions from $c_1$ to $c_2$ in a certain number of deterministic steps. We here consider the problem of efficiently \emph{merging} such proofs: given a proof $\Pi_1$ that $M$ transitions from $c_1$ to $c_2$, and a proof $\Pi_2$ that $M$ transitions from $c_2$ to $c_3$, can these proofs be efficiently merged into …

batch computation enable eprint report machine non omer pass problem producing rate report transitions verified

Business Information Security Officer

@ Metrolink | Los Angeles, CA

Senior Security Engineer

@ Freedom of the Press Foundation | Remote, 4 hour time zone overlap with New York City

Security Engineer

@ ChartMogul | Remote, EU

Malware Reverse Engineer

@ Two Six Technologies | Fort Meade, Maryland

SOC Analyst Level 3

@ OpenBet | Bengaluru, India

Course Developer, Network Security

@ Palo Alto Networks | Plano, TX, United States