Event

We introduce novel scheme framework to zero-knowledge prove that a vector has a specific Hamming weight, or is a rank-1 vector, or has entries in a small subspace. This can be used by itself to prove knowledge of a vector satisfying certain constraints (e.g.: Restricted Syndrome Decoding Problem) or can be used in a subprotocol to assist in electronic voting, lookup instances, and more.