Welcome to the resource topic for
**2023/1652**

**Title:**

On Sigma-Protocols and (packed) Black-Box Secret Sharing Schemes

**Authors:**
Claudia Bartoli, Ignacio Cascudo

**Abstract:**

\Sigma-protocols are a widely utilized, relatively simple and well understood type of zero-knowledge proofs. However, the well known Schnorr \Sigma-protocol for proving knowledge of discrete logarithm in a cyclic group of known prime order, and similar protocols working over this type of groups, are hard to generalize to dealing with other groups. In particular with hidden order groups, due to the inability of the knowledge extractor to invert elements modulo the order.

In this paper, we introduce a universal construction of \Sigma-protocols designed to prove knowledge of preimages of group homomorphisms for any abelian finite group. In order to do this, we first establish a general construction of a \Sigma-protocol for \mathfrak{R}-module homomorphism given only a linear secret sharing scheme over the ring \mathfrak{R}, where zero knowledge and special soundness can be related to the privacy and reconstruction properties of the secret sharing scheme. Then, we introduce a new construction of 2-out-of-n packed black-box secret sharing scheme capable of sharing k elements of an arbitrary (abelian, finite) group where each share consists of k+\log n-3 group elements.

From these two elements we obtain a generic ``batch’’ \Sigma-protocol for proving knowledge of k preimages of elements via the same group homomorphism, which communicates k+\lambda-3 elements of the group to achieve 2^{-\lambda} knowledge error.

For the case of class groups, we show that our \Sigma-protocol improves in several aspects on existing proofs for knowledge of discrete logarithm and other related statements that have been used in a number of works.

Finally, we extend our constructions from group homomorphisms to the case of ZK-ready functions, introduced by Cramer and Damg\aa rd in Crypto 09, which in particular include the case of proofs of knowledge of plaintext (and randomness) for some linearly homomorphic encryption schemes such as Joye-Libert encryption. However, in the case of Joye-Libert, we show an even better alternative, using Shamir secret sharing over Galois rings, which achieves 2^{-k} knowledge soundness by communicating k ciphertexts to prove k statements.

**ePrint:**
https://eprint.iacr.org/2023/1652

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .