All reports by Author Changrui Mu:

__
TR24-100
| 21st May 2024
__

Changrui Mu, Prashant Nalini Vasudevan#### Instance-Hiding Interactive Proofs

__
TR24-024
| 14th February 2024
__

Changrui Mu, Shafik Nassar, Ron Rothblum, Prashant Nalini Vasudevan#### Strong Batching for Non-Interactive Statistical Zero-Knowledge

Changrui Mu, Prashant Nalini Vasudevan

In an Instance-Hiding Interactive Proof (IHIP) [Beaver et al. CRYPTO 90], an efficient verifier with a _private_ input x interacts with an unbounded prover to determine whether x is contained in a language L. In addition to completeness and soundness, the instance-hiding property requires that the prover should not learn ... more >>>

Changrui Mu, Shafik Nassar, Ron Rothblum, Prashant Nalini Vasudevan

A zero-knowledge proof enables a prover to convince a verifier that $x \in S$, without revealing anything beyond this fact. By running a zero-knowledge proof $k$ times, it is possible to prove (still in zero-knowledge) that $k$ separate instances $x_1,\dots,x_k$ are all in $S$. However, this increases the communication by ... more >>>