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.
CITATION STYLE
Avitabile, G., Botta, V., Friolo, D., & Visconti, I. (2022). Efficient Proofs of Knowledge for Threshold Relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13556 LNCS, pp. 42–62). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-17143-7_3
Mendeley helps you to discover research relevant for your work.