On a new-member-joining-protocol design using bivariate polynomials based DKG algorithms

Authors:
Qian Wu;Yanyan Yang
Affiliations:
School of Information Engineering, Minzu Univ. of China, Beijing, China, P.R.;Technology School of Engineering, Portsmouth University, Beijing, UK
Venue:
BICS'13 Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems
Year:
2013

Citing 7
Cited 0

Adaptive Security for Threshold Cryptosystems

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Utility of Distributed Cryptography in P2P and MANETs: The Case of Membership Control

ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Threshold and Identity-based Key Management and Authentication for Wireless Ad Hoc Networks

ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
Efficient Node Admission for Short-lived Mobile Ad Hoc Networks

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
A threshold cryptosystem without a trusted party

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

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.