Batchman and Robin: Batched and Non-batched Branching for Interactive ZK

We describe a lightweight protocol for oblivious evaluation of a pseudorandom function (OPRF) in the presence of semihonest adversaries. In an OPRF protocol a receiver has an input r; the sender gets output s and the receiver gets output F(s; r), where ...

We explore Zero-Knowledge Proofs (ZKPs) of statements expressed as programs written in high-level languages, e.g., C or assembly. At the core of executing such programs in ZK is the repeated evaluation of a CPU step, achieved by branching over the CPU's ...

In the Zero-Knowledge Proof (ZKP) of a disjunctive statement, $\mathcal{P}$ and $\mathcal{V}$ agree on B fan-in 2 circuits ${\mathcal{C}}_0,\dots ,{\mathcal{C}}_{B-1}$ over a field $\mathbb{F}$; each circuit has $n_{\mathit{in}}$ inputs, $n_{\times }$ multiplications, and one output. $\mathcal{P}$ ’s goal is to demonstrate the knowledge of a witness $(i\mathrm{...}$$\mathit{}{\mathbb{}}^{{}_{\mathit{}}}$${\mathcal{}}_{\mathit{}}\mathit{}\mathrm{}$$\mathit{}$$\mathit{}$