8 problems

Given a $k$-dimensional subspace $W\in \mathbb{F}_2^n$ and vectors $x,z\in \mathbb{F}_2^n$, the coset state is … In the game considered here, $k=m$, $n=2m$, Alice sends the first h…

Let a four- or six-round $obreakmathrm{BCCF}$-protocol have four cheating probabilities, one for each party and each coin outcome. Four- and six-round BCCF bias conjecture. Ha…

Security conjecture. The protocol is secure against multi-qubit measurements as well.

Let a strong coin-flipping protocol based on bit-commitment be any protocol in the family formally defined in Section, and let its bias be the maximum excess of either party's chea…

A one-time memory (OTM) is used to build a one-time program by the construction described in GKR, and an LOCC adversary is an adversary restricted to local operations and classical…

The proposed one-time memories are intended to support one-time programs through a particular notion of leaky security. Leaky-security conjecture. The one-time memories satisfy a p…

Let $C$ and $D$ be the random error-correcting codes used in the one-time-memory construction. The construction is information-theoretically secure against one-pass LOCC adversarie…

One-time programs are software-protection primitives, and the proposed construction provides one-time memories with a restricted form of leakage. One-time-program construction conj…