On alternative approach for verifiable secret sharing
Kamil Kulesza, Zbigniew Kotulski, Joseph Pieprzyk

TL;DR
This paper introduces a novel 'free lunch' approach to verifiable secret sharing that aims to provide verification without additional costs, enhancing the practicality of secret sharing schemes.
Contribution
The paper proposes a new method for verifiable secret sharing that eliminates the usual verification overhead, making the process more efficient and accessible.
Findings
The approach enables verification without extra costs.
It simplifies the implementation of verifiable secret sharing.
Potential for broader adoption due to efficiency gains.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Chaos-based Image/Signal Encryption · Advanced Authentication Protocols Security
