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.
The work of this author has been funded by the European Commission under ACTS project AC095 (ASPeCT).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Blakley, B., Blakley, G.R., Chan, A.H., Massey, J.L.: Threshold schemes with dis-enrollment. In E.F. Brickell, editor, Lecture Notes in Computer Science 740, Advances in Cryptology — Crypto '92 (Springer-Verlag, Berlin, 1993) 540–548
Blakley, G.R.: Safeguarding cryptographic keys. In the Proceedings of AFIPS 1979 NCC, Vol. 48, Arlington,Va. (1979) 313–317
Brickell, E.F., Stinson, D.R.: The detection of cheaters in threshold schemes. In S. Goldwasser, editor, Lecture Notes in Computer Science 403, Advances in Cryptology — CRYPTO '88 (Springer-Verlag, Berlin, 1988) 564–577
Cachin, C.: On-line secret sharing. In C. Boyd, editor, Lecture Notes in Computer Science 1025, 5th IMA Conference on Cryptography and Coding (Springer-Verlag, Berlin, 1995) 190–198
Charnes, C., Pieprzyk, J., Safavi-Naini, R.: Conditionally secure secret sharing schemes with disenrollment capability. In Proceedings of the 2nd ACM Conference on Computer and Communications Security (Fairfax, Virginia, USA, 1994) 89–95
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22 (1976) 644–654
Hwang, S., Chang, C.: A dynamic secret sharing scheme with cheater detection. In Lecture Notes in Computer Science 1172, ACISP '96 (Springer-Verlag, Berlin, 1996) 48–55
Krawczyk, H.: Secret sharing made short. In Lecture Notes in Computer Science 773, Advances in Cryptology — CRYPTO '93 (Springer-Verlag, Berlin, 1993) 136–146
Laih, C.S., Harn, L., Lee, J.Y., Hwang, T.: Dynamic threshold scheme based on the definition of cross-product in an n-dimensional linear space. Journal Information Science and Engineering 7 (1991) 13–23
Pedersen, T.P.: Distributed provers with applications to undeniable signatures. In D. W. Davies, editor, Lecture Notes in Computer Science 547, Advances in Cryptology — Eurocrypt '91 (Springer-Verlag, Berlin, 1991) 221–238
Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Lecture Notes in Computer Science 576, Advances in Cryptology — Crypto '91 (Springer-Verlag, Berlin, 1992) 129–140
Pinch, R.G.E.: On-line multiple secret sharing. Electronics Letters 32 (1996) 1087–1088
Shamir, A.: How to share a secret. Communications of the ACM 22 (1979) 612–613
Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal 28 (1949) 656–715
Sun, H.-M., Shieh, S.-P.: Construction of dynamic threshold schemes. Electronics Letters 30 (1994) 2023–2025
Zhang, Y., Hardjono, T., Seberry, J.: Reusing shares in secret sharing schemes. The Computer Journal 37 (1994) 199–205
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L., Gollmann, D., Mitchell, C.J., Wild, P. (1997). Secret sharing with reusable polynomials. In: Varadharajan, V., Pieprzyk, J., Mu, Y. (eds) Information Security and Privacy. ACISP 1997. Lecture Notes in Computer Science, vol 1270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027925
Download citation
DOI: https://doi.org/10.1007/BFb0027925
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63232-0
Online ISBN: 978-3-540-69237-9
eBook Packages: Springer Book Archive