Secret sharing with reusable polynomials

N/ACitations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a threshold secret sharing scheme based on polynomial interpolation and the Diffie-Hellman problem. In this scheme shares can be used for the reconstruction of multiple secrets, shareholders can dynamically join or leave without distributing new shares to the existing shareholders, and shares can be individually verified during both share distribution and secret recovery.

Cite

CITATION STYLE

APA

Chen, L., Gollmann, D., Mitchell, C. J., & Wild, P. (1997). Secret sharing with reusable polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1270, pp. 183–193). Springer Verlag. https://doi.org/10.1007/BFb0027925

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free