Title: On a relation between verifiable secret sharing schemes and a class of error-correcting codes
Authors: Nikov, Ventzislav ×
Nikova, Svetla #
Issue Date: 2006
Publisher: Springer-verlag berlin
Series Title: Coding and cryptography vol:3969 pages:275-290
Abstract: In this paper we try to shed a new insight on Verifiable Secret Sharing Schemes (VSS). We first define a new "metric" (with slightly different properties than the standard Hamming metric). Using this metric we define a very particular class of codes that we call error-set correcting codes, based on a set of forbidden distances which is a monotone decreasing set. Next we redefine the packing problem for the new settings and generalize the notion of error-correcting capability of the error-set correcting codes accordingly (taking into account the new metric and the new packing). Then we consider burst-error interleaving codes proposing an efficient burst-error correcting technique, which is in fact the well known VSS and Distributed Commitments (DC) pair-wise checking protocol and we prove the error-correcting capability of the error-set correcting interleaving codes.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science