pith. sign in

arxiv: math/0211267 · v1 · pith:YDXJPYRGnew · submitted 2002-11-18 · 🧮 math.CO · cs.CR· cs.DM

On alternative approach for verifiable secret sharing

classification 🧮 math.CO cs.CRcs.DM
keywords secretsharingallowsapproachverifiableverificationalternativecapacity
0
0 comments X
read the original abstract

Secret sharing allows split/distributed control over the secret (e.g. master key). Verifiable secret sharing (VSS) is the secret sharing extended by verification capacity. Usually verification comes at the price. We propose "free lunch", the approach that allows to overcome this inconvenience.

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.