Abstract
Verifiable secret sharing (VSS) is a fundamental tool of threshold cryptography and distributed computing. A number of VSS schemes for sharing a secret that is an element of a finite field, either on threshold access structures or on general access structures have been available. In this paper, we study the verifiably sharing of a random element of a bilinear group on vector space access structures. We propose such two information-theoretical secure schemes: a basic scheme and a modified one with improved efficiency. The basic one is more general for applications while the modified one has a smaller computational cost compared with the basic one. The computational cost as well as the security analysis for the proposed schemes are presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Shamir, A.: How to share a secret. Comm. ACM 22, 612–613 (1979)
Chor, B., Goldwasser, S., Micall, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults, FOCS (1985)
Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: The 28th IEEE Symposium on the Foundations of Computer Science, pp. 427–437 (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)
Zhang, F., Wang, Y.: Construction of secret sharing schemes on access structure with transfer property. Acta Electronica Sinica 29, 1582–1584 (2001)
Zhang, F., Wang, Y.: An unconditional secure general verifiable secret sharing protocol. Jouranl of Computer Research and Development 39, 1199–1204 (2002)
Zhang, F., Zhang, F., Wang, Y.: A secure and efficient general VSS protocol. Journal of Software 13, 1187–1192 (2002)
Zhang, F., Gou, X., Wang, Y.: Efficient verifiable secret sharing on vector space access structures. Computer Engineering and Applications (2002)
Zhang, F., Shi, J., Wang, Y.: Information-theoretical secure verifiable secret sharing on vector space access structures. Journal of Electronics and Information Technology (8), 1288–1293 (2004)
Brickell, E.F.: Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput. 9, 105–113 (1989)
Padro, C., Sáez, G., Villar, J.L.: Detection of cheaters in vector space secret sharing schemes. Designs, Codes and cryptography (1999)
Baek, J., Zheng, Y.: Identity-based threshold signature scheme from the bilinear pairings. In: Proceedings of the international Conference on Information and Technology: Coding and Computing (2004)
Wu, T.Y., Tseng, Y.M.: A paring-based publicly verifiable secret sharing scheme. Journal of Systems Science and Complexity (2011)
Kiltz, E., Pietrzak, K.: Leakage resilient elGamal encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 595–612. Springer, Heidelberg (2010)
Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Computing 32(3), 586–615 (2003)
Gentry, C.: Practical identity-based encryption without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 445–464. Springer, Heidelberg (2006)
Shamir, A.: How to share a secret. Comm. ACM 22, 612–613 (1979)
Stinson, D.R.: An explication of secret sharing schemes. Designs, Codes and Cryptography 2, 357–390 (1992)
Gennaro, R.: Theory and practice of verifiable secret sharing. [Ph.D.Thesis]. MIT, pp. 51–107 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, J., Zhang, F. (2014). Information-Theoretical Secure Verifiable Secret Sharing with Vector Space Access Structures over Bilinear Groups. In: Huang, X., Zhou, J. (eds) Information Security Practice and Experience. ISPEC 2014. Lecture Notes in Computer Science, vol 8434. Springer, Cham. https://doi.org/10.1007/978-3-319-06320-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-06320-1_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06319-5
Online ISBN: 978-3-319-06320-1
eBook Packages: Computer ScienceComputer Science (R0)