Applications of Blockchain (BC) technology and Cyber-Physical Systems (CPS) are
increasing exponentially. However, framing resilient and correct smart contracts (SCs) for …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

The recent MIP*= RE theorem of Ji, Natarajan, Vidick, Wright, and Yuen shows that the
complexity class MIP* of multiprover proof systems with entangled provers contains all …

We construct a constant-round zero-knowledge classical argument for NP secure against
quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and …

Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with
strong efficiency properties. Applications of SNARKs often involve proving computations that …

We construct perfect zero-knowledge probabilistically checkable proofs (PZK-PCPs) for
every language in# P. This is the first construction of a PZK-PCP for any language outside …

In this work we consider the interplay between multiprover interactive proofs, quantum
entanglement, and zero knowledge proofs-notions that are central pillars of complexity …

Streaming interactive proofs (SIPs) enable a space-bounded algorithm with one-pass
access to a massive stream of data to verify a computation that requires large space, by …

Given that reliable cloud quantum computers are becoming closer to reality, the concept of
delegation of quantum computations and its verifiability is of central interest. Many models …

We show that for every polynomial q* there exist polynomial-size, constant-query, non-
adaptive PCPs for NP which are perfect zero knowledge against (adaptive) adversaries …