Abstract
Secret sharing schemes have very wide applications in modern electronic society. In a secret sharing scheme, the shared secret is divided into multiple shares and only more than certain number of shares can reconstruct the secret. However, sometimes members may leave or join a secret sharing system in some variable circumstances. Therefore, constructing dynamic secret sharing is an important task. In this paper, we discuss a protocol about enrolling and revoking members simultaneously in a secret sharing scheme. Compared with previous protocols, our protocol can accomplish a new member’s enrollment and an old member’s revocation in fewer rounds. This protocol is especially useful for the circumstances where members join and leave secret sharing system frequently such as ad hoc networks.
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
Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317. AFIPS Press, NJ (1979)
Feldman, P.: A Pratical Scheme for Non-Interactive Verifiable Secret Sharing. In: Proc. 28th Annual FOCS, pp. 427–437. IEEE Press, New York (1987)
Pedersen, T.P.: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)
Schoenmakers, B.: A simple Publicly Verifiable Secret Sharing Scheme and its Application to Electronic Voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148–164. Springer, Heidelberg (1999)
Stadler, M.: Publicly Verifiable Secret Sharing. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)
Fujisaki, E., Okamoto, T.: A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 32–46. Springer, Heidelberg (1998)
Young, A., Yung, M.: A PVSS as Hard as Discrete Log and Shareholder Separability. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 287–299. Springer, Heidelberg (2001)
Desmedt, Y., Jajodia, S.: Redistributing secret shares to new access structures and its application. Technical Report ISSE TR-97-01, George Mason University (1997)
Wong, T.M., Wang, C.X., Wing, J.M.: Verifiable secret redistribution for archive systems. In: Proc. of the 1st International IEEE Security in Storage Workshop, pp. 94–106. IEEE Press, New York (2002)
Gupta, V., Gopinaph, K.: An Extended Verifiable Secret Redistribution Protocol for Archival Systems. In: The First International Conference on Availability, Reliability and Security 2006, pp. 8–15. IEEE Press, New York (2006)
Yu, J., Kong, F.Y., Li, D.X.: Verifiable Secret Redistribution for PPS Schemes. In: Proc. of the 2nd Information Security Practice and Experience Conference; Journal of Shanghai Jiaotong University(Science), vol. E-11(2), pp. 71–76 (2006)
Li, X., He, M.X.: A Protocol of Member-Join in a Secret Sharing Scheme. In: Chen, K., Deng, R., Lai, X., Zhou, J. (eds.) ISPEC 2006. LNCS, vol. 3903, pp. 134–141. Springer, Heidelberg (2006)
Yu, J., Kong, F.Y., Hao, R.: Publicly Verifiable Secret Sharing with Enrollment Ability. In: the 8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, pp. 194–199. IEEE Computer Society, New York (2007)
Yu, J., Kong, F.Y., Hao, R., Li, X.L.: How to Publicly Verifiably Expand a Member without Changing Old Shares in a Secret Sharing Scheme. In: Yang, C.C., Chen, H., Chau, M., Chang, K., Lang, S.-D., Chen, P.S., Hsieh, R., Zeng, D., Wang, F.-Y., Carley, K.M., Mao, W., Zhan, J. (eds.) ISI Workshops 2008. LNCS, vol. 5075, pp. 138–148. Springer, Heidelberg (2008)
Yu, J., Kong, F.Y., Cheng, X.G., Hao, R.: Two Protocols for Member Revocation in Secret Sharing Schemes. In: Chau, M., Wang, G.A., Zheng, X., Chen, H., Zeng, D., Mao, W. (eds.) PAISI 2011. LNCS, vol. 6749, pp. 64–70. Springer, Heidelberg (2011)
ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. on IT 31(4), 469–472 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, J., Wang, S., Zhao, H., Shu, M., Lv, J., Guo, Q. (2012). A Simultaneous Members Enrollment and Revocation Protocol for Secret Sharing Schemes. In: Chau, M., Wang, G.A., Yue, W.T., Chen, H. (eds) Intelligence and Security Informatics. PAISI 2012. Lecture Notes in Computer Science, vol 7299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30428-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-30428-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30427-9
Online ISBN: 978-3-642-30428-6
eBook Packages: Computer ScienceComputer Science (R0)