Verifiable Multi-Secret Sharing Based on LFSR Sequences

In Verifiable Multi-Secret Sharing schemes (VMSSs), many secrets can be shared but only one share is kept by each user and this share is verifiable by others. In this paper, the authors propose two secure, efficient, and verifiable (t; n) multi-secret sharing schemes, namely Scheme-I and Scheme-II. Scheme-I is based on the Lagrange interpolating polynomial and the LFSR-based public key cryptosystem. The Lagrange interpolating polynomial is used to split and reconstruct the secrets and the LFSR-based public key cryptosystem is employed to verify the validity of the data. Scheme-II is designed according to the LFSR sequence and the LFSR-based public key cryptosystem.

Provided by: George Washington University Topic: Security Date Added: May 2012 Format: PDF

Find By Topic