Abstract
A multi-stage secret sharing (MSS) scheme is a method of sharing a number of secrets among a set of participants, such that any authorized subset of participants could recover one secret in every stage. The first MSS scheme was proposed by He and Dawson in 1994, based on Shamir’s well-known secret sharing scheme and one-way functions. Several other schemes based on different methods have been proposed since then. In this paper, the authors propose an MSS scheme using All-Or-Nothing Transform (AONT) approach. An AONT is an invertible map with the property that having “almost all” bits of its output, one could not obtain any information about the input. This characteristic is employed in the proposed MSS scheme in order to reduce the total size of secret shadows, assigned to each participant. The resulted MSS scheme is computationally secure. Furthermore, it does not impose any constraint on the order of secret reconstructions. A comparison between the proposed MSS scheme and that of He and Dawson indicates that the new scheme provides more security features, while preserving the order of public values and the computational complexity.
Chapter PDF
Similar content being viewed by others
References
Shamir, A.: How to Share a Secret. Commun. ACM 22(11), 612–613 (1979)
Blakley, G.R.: Safeguarding Cryptographic Keys. In: AFIPS, National Computer Conference, vol. 48, pp. 313–317 (1979)
Stadler, M.: Publicley Verifiable Secret Sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)
Ogata, W., Kurosawa, K.: Optimum Secret Sharing Scheme Secure against Cheating. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 200–211. Springer, Heidelberg (1996)
Barwick, S.G., Jackson, W.A., Martin, K.M.: Updating the Parameters of a Threshold Scheme by Minimal Broadcast. IEEE Transactions on Information Theory 51(2), 620–633 (2005)
Stinson, D.R.: An Explication of Secret Sharing Schemes. Des., Codes, Cryptogr. 2, 357–390 (1992)
He, J., Dawson, E.: Multi-Stage Secret Sharing Scheme Based on One-way Function. Electronic Letters 30(19), 1591–1592 (1994)
Chien, H.Y., Jan, J.K., Tseng, Y.M.: A Practical (t,n) Multi-Secret Sharing Scheme. IEICE Transactions on Fundamentals E83-A(12), 2762–2765 (2000)
Runhua, S., Liusheng, H., Yonglong, L., Hong, Z.: A Threshold Multi-Secret Sharing Scheme. In: IEEE International Conference on Networking, Sensing and Control, ICNSC 2008, pp. 1705–1707 (2008)
Chan, C.W., Chang, C.C.: A Scheme for Threshold Multi-Secret Sharing. Applied Mathematics and Computation 166, 1–14 (2006)
Harn, L.: Comment: Multistage Secret Sharing based on One-way Function. Electronics Letters 31(4), 262 (1995)
Yang, C.C., Chang, C.C., Hwang, M.S.: A (t,n) multi-secret sharing scheme. Applied Mathematics and Computation 151(2), 483–490 (2004)
Rivest, R.: All-or-Nothing Encryption and the Package Transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 210–218. Springer, Heidelberg (1997)
Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-Resilient Functions and All-or-Nothing Transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 453–469. Springer, Heidelberg (2000)
Karnin, E.D., Greene, J.W., Hellman, M.E.: On Secret Sharing System. IEEE Transaction on Information Theory 29(1), 35–41 (1983)
Chor, B., Friedman, J., Goldreich, O., Hastad, J., Rudich, S., Smolensky, R.: The Bit Extraction Problem or t-resilient Functions. In: FOCS, pp. 396–407 (1985)
He, J., Dawson, E.: Multisecret-Sharing Scheme Based on One-way Function. Electronic Letters 31(2), 93–95 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fatemi, M., Eghlidos, T., Aref, M. (2009). A Multi-stage Secret Sharing Scheme Using All-or-Nothing Transform Approach. In: Qing, S., Mitchell, C.J., Wang, G. (eds) Information and Communications Security. ICICS 2009. Lecture Notes in Computer Science, vol 5927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11145-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-11145-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11144-0
Online ISBN: 978-3-642-11145-7
eBook Packages: Computer ScienceComputer Science (R0)