Recently, there has been great interest towards constructing efficient zero-knowledge proofs for practical languages. In this work, we focus on proofs for threshold relations, in which the prover is required to prove knowledge of witnesses for k out of ℓ statements. The main contribution of our work is an efficient and modular transformation that starting from a large class of Σ -protocols and a corresponding threshold relation Rk,ℓ, provides an efficient Σ -protocol for Rk,ℓ with improved communication complexity w.r.t. prior results. Our transformation preserves statistical/perfect honest-verifier zero knowledge.

Efficient Proofs of Knowledge for Threshold Relations

Avitabile G.
;
Botta V.;Friolo D.;Visconti I.
2022-01-01

Abstract

Recently, there has been great interest towards constructing efficient zero-knowledge proofs for practical languages. In this work, we focus on proofs for threshold relations, in which the prover is required to prove knowledge of witnesses for k out of ℓ statements. The main contribution of our work is an efficient and modular transformation that starting from a large class of Σ -protocols and a corresponding threshold relation Rk,ℓ, provides an efficient Σ -protocol for Rk,ℓ with improved communication complexity w.r.t. prior results. Our transformation preserves statistical/perfect honest-verifier zero knowledge.
978-3-031-17142-0
978-3-031-17143-7
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11386/4809776
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact