Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation - 2018

PROJECT TITLE :

Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation - 2018

ABSTRACT:

Preserving information confidentiality in clouds may be a key issue. Secret Sharing, a cryptographic primitive for the distribution of a secret among a group of n participants designed so that solely subsets of shareholders of cardinality zero <; t = n are allowed to reconstruct the secret by pooling their shares, can help mitigating and minimizing the problem. A desirable feature of Secret Sharing schemes is cheater detection, i.e., the flexibility to detect a number of malicious shareholders making an attempt to reconstruct the secret by getting legal shares from the opposite shareholders whereas providing them with pretend shares. Verifiable Secret Sharing schemes solve this drawback by allowing shareholders verifying the others' shares. We present new verification algorithms providing arbitrary secret sharing schemes with cheater detection capabilities, and prove their house potency with regard to other schemes appeared within the literature. We tend to additionally introduce, in one among our schemes, the Exponentiating Polynomial Root Downside (EPRP), that is believed to be NP-Intermediate and thus difficult.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here