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 l statements.The main contribution of our work is an efficient and modular transformation that starting from a large class of Sigma-protocols and a corresponding threshold relation R-k,R-l, provides an efficient Sigma-protocol for R-k,R-l 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.. - 13556 LNCS:(2022), pp. 42-62. (Intervento presentato al convegno 27th European Symposium on Research in Computer Security tenutosi a Copenhagen, Denmark) [10.1007/978-3-031-17143-7_3].
Efficient Proofs of Knowledge for Threshold Relations
Botta V.;Friolo D.;Visconti I.
2022
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 l statements.The main contribution of our work is an efficient and modular transformation that starting from a large class of Sigma-protocols and a corresponding threshold relation R-k,R-l, provides an efficient Sigma-protocol for R-k,R-l with improved communication complexity w.r.t. prior results. Our transformation preserves statistical/perfect honest-verifier zero knowledge.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
