Abstract
Since the introduction of public-key cryptography by Diffe and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized. Although the discrete logarithm problem as first employed by Diffe and Hellman was defined explicitly as the problem of finding logarithms with respect to a generator in the multiplicative group of the integers module a prime, this idea can be extended to arbitrary groups and in particular, to elliptic curve groups. The resulting public-key systems provide relatively small block size, high speed, and high security. In this paper, a vector space secrets sharing scheme is proposed in detail. Its security is based on the security of ECC. This scheme has the following characteristic: the precondition of (t,n)- threshold secret sharing scheme that all assignees purview must be same is generalized. A verifiable infrastructure is provided, which can be used to detect the cheaters from the dealers and assignees. The shared key distributed by dealer is encrypted based on ECC, which enhances the security. So this scheme is of less computation cost which is valuable in applications with limited memory, communications bandwidth or computing power.
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
Mulan, L., Zhanfei, Z., Xiaoming, C.: Secret sharing scheme. Chin. Bull. 45(9), 897–906 (2000)
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proce. AFIPS 1979 Nat. Comput. Conf., vol. 48, pp. 313–317 (1979)
Laih, C.-S., Harn, L., Lee, J.-Y., Hwang, T.: Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-dimensional Linear Space. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 286–298. Springer, Heidelberg (1990)
Chunxiazng, X., Guozhen, X.: A threshold multiple secret sharing scheme. Acta Electronica Sinica 10(32), 1688–1689 (2004)
Wenping, M., Xinhai, W.: Unconditionally secure verifiable secret sharing system. J. China Inst. Commun. 4(25), 64–68 (2004)
Brickell, E.F.: Some Ideal Secret Sharing Schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 468–475. Springer, Heidelberg (1990)
Chunxiang, X., Kai, C., Guozhen, X.: A secure Vector space secret sharing scheme. Acta Electronica Sinica 5(30), 715–718 (2002)
Aifen, S., Yixian, Y., Xinxin, N., Shoushan, L.: On the Authenticated key Agreement Protocol Based on Elliptic Curve Cryptography. J. Beijing Univ. Post. Telecomm. 3(27), 28–32 (2004)
Yajuan, Z., Yuefei, Z., Qiusheng, H.: Elliptic Curve Key-Exchange Protocol. J. Inf. Engg. University 4(5), 1–5 (2004)
Wenyu, Z., Qi, S.: The Elliptic Curves over Z n and key Exchange Protocol. Acta Electronica Sinica 1(33), 83–87 (2005)
Brickell, E.F.: Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 9, 105–113 (1989)
Rishivarman, A.R., Parthasarathy, B., Thiyagarajan, M.: An efficient performance of GF(25) arithmatic in an elliptic curve cryptosystem. Int. J. Comput. Appl. 4(2), 111–116 (2009)
Rishivarman, A.R., Parthasarathy, B., Thiyagarajan, M.: A Montgomery representation of elements in GF(25) for efficient arithmetic to use in ECC. Int. J. Adv. Netw. Appl. 1(5), 323–326 (2010)
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
Rishivarman, A.R., Parthasarathy, B., Thiagarajan, M. (2012). A Key Sharing Scheme over GF(25) to Use in ECC. In: Balasubramaniam, P., Uthayakumar, R. (eds) Mathematical Modelling and Scientific Computation. ICMMSC 2012. Communications in Computer and Information Science, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28926-2_58
Download citation
DOI: https://doi.org/10.1007/978-3-642-28926-2_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28925-5
Online ISBN: 978-3-642-28926-2
eBook Packages: Computer ScienceComputer Science (R0)