On alternative approach for verifiable secret sharing

2002/11/18 by Kamil Kulesza, Kulesza, Kamil, Zbigniew Kotulski +3
Computer Science · Mathematics · #Advanced Authentication Protocols Security #Chaos-based Image/Signal Encryption #Combinatorics (math.CO) #Cryptography and Data Security #Cryptography and Security (cs.CR) #D.4.6 #Discrete Mathematics (cs.DM) #E.4 #FOS: Computer and information sciences #FOS: Mathematics #cs.CR #cs.DM #math.CO #msc:D.4.6 #msc:E.4

paper · pdf · doi:10.48550/arxiv.math/0211267

This is poster that was presented on ESORICS2002 conference in Zurich. It consists of 4 color pages, with proposal and flowcharts

arxiv created 2002/11/18 · openalex publication_date 2002/11/18 · arxiv updated 2016/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• A Survey on Perfectly-Secure Verifiable Secret-Sharing
• False shares in verifiable secret sharing with finite field commitments
• Verifiable Weighted Secret Sharing
• A Novel Approach for Verifiable Secret Sharing by using a One Way Hash Function
• On ASGS framework: general requirements and an example of implementation