Verifiable symmetric polynomial-based key distribution schemes
Article first published online: 11 OCT 2012
Copyright © 2012 John Wiley & Sons, Ltd.
Security and Communication Networks
Volume 6, Issue 8, pages 1028–1034, August 2013
How to Cite
Liu, Y.-x., Zhang, Y.-q., Harn, L. and Hu, Y.-p. (2013), Verifiable symmetric polynomial-based key distribution schemes. Security Comm. Networks, 6: 1028–1034. doi: 10.1002/sec.671
- Issue published online: 10 JUL 2013
- Article first published online: 11 OCT 2012
- Manuscript Accepted: 5 SEP 2012
- Manuscript Revised: 31 JUL 2012
- Manuscript Received: 22 DEC 2011
- National Science Foundation of China. Grant Number: 60970140
- symmetric polynomial;
- key distribution;
Symmetric polynomial-based key distribution scheme has been widely adopted in various communication applications. This type of key distribution consists of a server and a set of users, where the server is responsible to distribute shares for each user via a symmetric polynomial. Based on the property of symmetry of this polynomial, each pair of users can compute a common secret key using their shares for establishing a secure communication channel. However, some users may receive faulty shares from the server because of some uncertain factors in the communication environment, such as software failures and transmission errors. As a result, the users who receive faulty shares cannot share common secret keys with other users. To solve this problem, in this paper, we propose two individual verifiable key distribution schemes on the basis of a symmetric polynomial based key distribution. In both our proposed schemes, the server adopts the same approach to distribute shares for users; the users are able to verify the validity of their shares without revealing them before establishing communication channels. If all shares are verified valid, users can ensure that each pair of them possesses a common secret key, they can establish secure communication channels when needed; otherwise, all users can collaborate to identify those users who possess faulty shares and require the server to distribute a set of valid shares for those users. Furthermore, both our proposed schemes are efficient, because the procedures of verification and identification do not involve any complicated cryptographic operation. Copyright © 2012 John Wiley & Sons, Ltd.