Referenced Items are not available for this document.
Most existing distribute CA constructing is based on (n, k) threshold scheme in mobile ad hoc networks, node's share need update for preventing mobile adversaries from attacks, which brings excessive overhead and need a secure channel to dispense secret share. In this paper, a distribute CA constructing algorithm based on multi-secret sharing is proposed to solve above problems in mobile ad hoc networks. In this scheme, node' share is not updated for preventing mobile adversaries for attacks, furthermore it is unnecessary to maintain a secure channel in the updating period. The analysis results show that the scheme proposed in this paper is simple, feasible and easy to be implemented.
Published in:
Information and Computing Science, 2009. ICIC '09. Second International Conference on
(Volume:1
)
Date of Conference: 21-22 May 2009
- Page(s):
- 171 - 174
- Print ISBN:
- 978-0-7695-3634-7
- INSPEC Accession Number:
- 10791863
- Conference Location :
- Manchester
- Digital Object Identifier :
- 10.1109/ICIC.2009.50
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
