Title :
A Scheme of Detecting Cheaters Wholly in Threshold Secret Sharing for Mobile Ad Hoc Networks
Author :
Zhang, Yi ; Chen, Wenxing
Author_Institution :
Key Lab. of mobile Commun. Technol., Chongqing Univ. of Posts & Telecommun., Chongqing
Abstract :
Because of the distributed character of Mobile Ad hoc Networks, secret sharing is a ideal scheme for keeping system secret information. However, methods of detecting cheaters wholly in threshold secret sharing are few, so far. If another participant can join the t participants, t+1 participants in total, according to the scheme proposed in this paper, the existence of cheaters can be checked out only calculating equations once, requiring no other information. This scheme is a perfect sharing scheme. Its information rate is 1. The probability of one cheater´s success is 0 and it is less than 1/p (where p is a large prime) for two or three cheaters in probability of success.
Keywords :
ad hoc networks; mobile radio; telecommunication security; cheater detection scheme; mobile ad hoc networks; success probability; threshold secret sharing; Communications technology; Cryptography; Equations; Information rates; Mobile ad hoc networks; Mobile communication; Organizing; Parallel processing; Polynomials; Testing; Cheating; Detecting in whole; Mobile Ad hoc networks; Threshold secret sharing;
Conference_Titel :
Network and Parallel Computing, 2008. NPC 2008. IFIP International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-0-7695-3354-4
DOI :
10.1109/NPC.2008.61
