2 problems

By a generator $g$ we mean a map whose restriction $g_n$ to $\{0,1\}^n$ has range contained in $\{0,1\}^m$, where $m=m(n)>n$, and is computed by a circuit of size $m^{O(1)}$. For…

Let $B_n$ be the braid group and let $bc$ be a distribution on $B_n$. Computational zero-knowledge conjecture. The Sibert et al. authentication scheme can be computationally zero k…