Publicly Verifiable Secret Sharing Using Non-Abelian Groups
classification
💻 cs.CR
math.GR
keywords
secretgroupssharingnon-abelianabelianallowingcheckdealer
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.