Abstract
In many wireless mobile applications, new member joining problem often occurs when a new player hopes to get a share of private key in order to join a multi-player group, which has jointly generated a pair of private and public keys based on some distributed key generation (DKG) protocols. We propose a New-Member-Joining (NMJ) protocol built upon bivariate polynomials based DKG scheme to completely solve the problem. A proof of security of the protocol in terms of correctness and secrecy is present.
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
Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98–115. Springer, Heidelberg (1999)
Desmedt, Y.G., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)
Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295–310. Springer, Heidelberg (1999)
Wu, Q., et al.: On A Practical Distributed Key Generation Scheme Based on Bivariate Polynomials. In: WiCom 2011, pp. 338–342 (2011)
Narasimha, M., et al.: On the Utility of Distributed Cryptography in P2P and MANETs: The Case of Membership Control. In: IEEE International Conference on Network Protocols, pp. 336–345 (2003)
Saxena, N., et al.: Efficient Node Admission for Short lived Mobile Ad Hoc Networks. In: IEEE International Conference on Network Protocols (2005)
Deng, H., et al.: Threshold and identity-based key management and authentication for wireless Ad Hoc networks. In: International Conference on Information Technology: Coding and Computing (ITCC 804), vol. 1, pp. 107–115 (2004)
Stinson., D.R., et al.: An application of covering designs: determining the maximum consistent set of shares in a threshold scheme. Ars Comb 53 (1999)
Berlekamp, et al.: Error correction of algebraic block codes. US Patent 4,633,470 (2006)
Kong, J., et al.: Providing robust and ubiquitous security support for MANET. In: IEEE ICNP (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Q., Yang, Y. (2013). On a New-Member-Joining-Protocol Design Using Bivariate Polynomials Based DKG Algorithms. In: Liu, D., Alippi, C., Zhao, D., Hussain, A. (eds) Advances in Brain Inspired Cognitive Systems. BICS 2013. Lecture Notes in Computer Science(), vol 7888. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38786-9_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-38786-9_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38785-2
Online ISBN: 978-3-642-38786-9
eBook Packages: Computer ScienceComputer Science (R0)