Abstract
This paper presents a simple construction of an efficient publicly verifiable secret sharing scheme (PVSS) in hierarchical settings that uses bilinear pairing (BLP) maps. Till date, hierarchical secret sharing was confined to public key infrastructure (PKI) settings. Use of BLP maps in our scheme yields better security and verifiability. Communications between the Dealer and participants is achieved using an efficient certificateless signcryption (CLSC) scheme. Comparative study with prominent schemes exhibits superior performance of our scheme.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In case a participant occurs in multiple groups or clusters, they will receive multiple shares of individual parents. During secret reconstruction, relevant shares of concerned groups are used. Therefore group-wise hierarchy is enough to maintained.
- 2.
The symbol \(\in _R\) is reserved for random choice of an element from a given set throughout this paper.
- 3.
Practical implementation of most systems require credential verification in person, that can be followed by this partial transmission step. Therefore in practice no extra transmission is required in most applications due to this step.
- 4.
The symbol \(:=\) denotes ‘define’. \(S^{sh}_{id_i}\) denotes share of \(id_i\).
- 5.
We assume the same threshold \(t_{hg}\) for individual groups hg at a given depth in our hierarchy. Of course polynomials \(f^{hg}\) for individual lower level groups differ due varied \(S_{\alpha }\)’s for each first level participant \(P_{\alpha }\). Analysis of threshold schemes with groups possessing varied number of members/weights is certainly more interesting. Due to page limits, we differ this analyzes for extended version of our work.
References
Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, 30 November – 4 December 2003, Proceedings, pp. 452–473 (2003)
Barbosa, M., Farshim, P.: Certificateless signcryption. In: Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2008, Tokyo, Japan, 18–20 March 2008, pp. 369–372 (2008)
Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. J. Cryptol. 17(4), 321–334 (2004)
Basu, A., Sengupta, I., Sing, J.K.: Cryptosystem for secret sharing scheme with hierarchical groups. Int. J. Netw. Secur. 15(6), 455–464 (2013)
Blake, I.F., Murty, V.K., Xu, G.: Refinements of Miller’s algorithm for computing the weil/tate pairing. J. Algorithms 58(2), 134–149 (2006)
Blakley, G.R.: Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, p. 313. IEEE Computer Society (1899)
Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Advances in Cryptology CRYPTO 2001, pp. 213–229. Springer (2001)
Chen, Z., Wu, C.: A new efficient certificateless signcryption scheme. In: Proceedings of the 2008 International Symposium on Information Science and Engineering (ISISE), pp. 661–664 (2008)
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21–23 October 1985, pp. 383–395 (1985)
Duursma, I.M., Lee, H.: Tate pairing implementation for hyperelliptic curves y\({}^{\text{2}}\) = x\({}^{\text{p }} -\) x + d. In: Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, 30 November – 4 December 2003, Proceedings, pp. 111–123 (2003)
Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 427–438 (1987)
Gentry, C., Silverberg, A.: Hierarchical id-based cryptography. In: Advances in Cryptology - ASIACRYPT 2002, 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, 1–5 December 2002, Proceedings, pp. 548–566 (2002)
Liu, Z., Hu, Y., Zhang, X., Ma, H.: Certificateless signcryption scheme in the standard model. Inf. Sci. 180(3), 452–464 (2010)
Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security SCIS (2000). (in Japanese, English version available from the authors)
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Shamir, A.: Identity-based cryptosystems and signature schemes. In: Advances in Cryptology, Proceedings of CRYPTO 1984, Santa Barbara, California, USA, 19–22 August 1984, Proceedings, pp. 47–53 (1984)
Stadler, M.: Publicly verifiable secret sharing. In: Advances in Cryptology - EUROCRYPT 1996, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, 12–16 May 1996, Proceeding, pp. 190–199 (1996)
Xie, W., Zhang, Z.: Efficient and provably secure certificateless signcryption from bilinear maps. In: Proceedings of the IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010, 25–27 June 2010, Beijing, China, pp. 558–562 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Sarkar, P., Nandi, S., Chowdhury, M.U. (2018). Publicly Verifiable Secret Sharing Scheme in Hierarchical Settings Using CLSC over IBC. In: Abawajy, J., Choo, KK., Islam, R. (eds) International Conference on Applications and Techniques in Cyber Security and Intelligence. ATCI 2017. Advances in Intelligent Systems and Computing, vol 580. Edizioni della Normale, Cham. https://doi.org/10.1007/978-3-319-67071-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-67071-3_27
Published:
Publisher Name: Edizioni della Normale, Cham
Print ISBN: 978-3-319-67070-6
Online ISBN: 978-3-319-67071-3
eBook Packages: EngineeringEngineering (R0)