Abstract
The secret considered is a binary string of fixed length. In the paper we propose a method of automatic secret generation and sharing. We show how to simultaneously generate and share random secret. Such a secret remains unknown until it is reconstructed. Next, we propose a method of automatic sharing of a known secret. In this case the Dealer does not know the secret and the secret's Owner does not know the shares. We discuss how to use extended capabilities in the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asmuth C. and Bloom J. 1983. ‘A modular approach to key safeguarding’. IEEE Transactions on Information Theory IT-29, pp. 208–211
Blakley G.R. 1979. ’safeguarding cryptographic keys’. Proceedings AFIPS I979 National Computer Conference, pp. 313–317.
Blundo C, Giorgio Gaggia A., Stinson D.R. 1997.‘On the dealer's randomness required in secret sharing schemes’. Designs, Codes and Cryptography 11, pp. 107–122.
Blundo C, Stinson D.R. 1997.’ Anonymous secret sharing schemes’. Discrete Applied Mathematics 77, pp. 13–28.
Brickell E.F. 1989. ’some ideal secret sharing schemes’ Journal of Combinatorial Mathematics and Combinatorial Computing 6, pp. 105–113.
Kamin E.D., J.W. Greene, and Hellman M.E.1983. ‘On secret sharing systems’. IEEE Transactions on Information Theory IT-29, pp. 35–41.
Kotulski Z. 2001. ‘Random number generators: algorithms, testing, applications’. (Polish) Mat. Stosow. No.2(43), pp. 32–66.
Kulesza K., Kotulski Z. 2002. ‘On automatic secret generation and sharing, Part 1,2’ Proceedings of the 9 th International Conference on Advanced Computer Systems, ACS′2002, pp. 81–96.
Menezes A.J, van Oorschot P. and Vanstone S.C. 1997. ‘Handbook of Applied Cryptography’. CRC Press, Boca Raton.
Pieprzyk J. 1995. ‘An introduction to cryptography’, draft from the Internet.
Shamir A.1979. ‘How to share a secret’. Communication of the ACM22, pp. 612–613
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this paper
Cite this paper
Kulesza, K., Kotulski, Z. (2003). On automatic secret generation and sharing for Karin-Greene-Hellman scheme. In: Sołdek, J., Drobiazgiewicz, L. (eds) Artificial Intelligence and Security in Computing Systems. The Springer International Series in Engineering and Computer Science, vol 752. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9226-0_22
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9226-0_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4847-4
Online ISBN: 978-1-4419-9226-0
eBook Packages: Springer Book Archive