Publicly Verifiable Secret Sharing Using Non-Abelian Groups
arXiv:1403.3661v31 citations
Originality Synthesis-oriented
AI Analysis
This work addresses security concerns in cryptographic protocols for distributed systems, but it is incremental as it adapts known methods to a different mathematical setting.
The paper tackles the problem of verifying secret shares in secret sharing protocols by extending existing techniques from abelian to non-abelian groups, resulting in a method that allows public verification of share validity.
In his paper Stadler develops techniques for improving the security of existing secret sharing protocols by allowing to check whether the secret shares given out by the dealer are valid. In particular, the secret sharing is executed over abelian groups. In this paper we develop similar methods over non-abelian groups.