Expand description
Labrador Prover
This module implements the prover side of the protocol sketched in
Fig. 2 of the paper (page 17). All algebra is carried out over the ring
(R_q = \mathbb{Z}_q[x]/(x^d+1)), where q is 32-bit modulo and d is polynomial degree.
Important — security parameters: The protocol is parameterised by
rank n, multiplicity r, operator norm β, decomposition depths t_1,t_2, and
security parameter λ = env_params::SECURITY_PARAMETER.
Structs§
- Labrador
Prover - Implements the steps executed by the prover (\mathcal{P}) in the paper.