In this work a practical lattice-based zero-knowledge proof for multiplicative relation between committed values is constructed. The existing protocol uses many garbage commitments for random masking polynomials which leads to the large proof size. Another approach was used which needs only one additional commitment to a garbage term and achieves smaller proof size and clearer intuition.
Нгуен В. (науч. рук. Давыдов В.В.) LATTICE-BASED ZERO-KNOWLEDGE PROOF FOR MULTIPLICATIVE RELATION BETWEEN COMMITTED VALUES // Сборник тезисов докладов конгресса молодых ученых. Электронное издание. – СПб: Университет ИТМО, [2022]. URL: https://kmu.itmo.ru/digests/article/8033