An efficient proactive RSA scheme for large-scale ad hoc networks

A previous proactive RSA scheme for large-scale ad hoc network has been shown to be faulty. In this paper, we present a new proactive RSA scheme for ad hoc networks, which includes four protocols： the initial key distribution protocol, the share refreshing protocol, the share distribution protocol, and the signature generation protocol. This scheme has two advantages： the building blocks are secure, and the system is efficient.

Efficient Data Integrity Using Enhanced Secret Sharing Scheme for MANET

Mobile Ad Hoc Networks consist of nodes which are wireless and get organized based on the transmission requirement. These nodes are mobile nodes, so they communicate with each other without any fixed access point. This type of network faces several attacks because of its mobility nature. In MANET, black hole attacks may cause packet dropping or misrouting of packets during transmission from sender to receiver. This may lead to performance degradation in the network. To surmount this issue, we propose the modified secret sharing scheme to provide the data protection from unauthorized nodes, consistency of data and genuineness. In this algorithm, initially the identification of black hole attacks is achieved and followed by data protection from malicious nodes and also this scheme checks for the reality of the data. Here, we detect the misbehaviour that is dropping or misrouting using verifiable secret sharing scheme. The proposed algorithm achieves the better packet delivery ratio, misbehaviour detection efficiency, fewer packets overhead and end-to-end delay than the existing schemes. These can be viewed in the simulation results.

A proactive secret sharing scheme based on Chinese remainder theorem

If an adversary tries to obtain a secret s in a(t,n)threshold secret sharing(SS)scheme,it has to capture no less than t shares instead of the secret s directly.However,if a shareholder keeps a fixed share for a long time,an adversary may have chances to filch some shareholders’shares.In a proactive secret sharing(PSS)scheme,shareholders are supposed to refresh shares at fixed period without changing the secret.In this way,an adversary can recover the secret if and only if it captures at least t shares during a period rather than any time,and thus PSS provides enhanced protection to long-lived secrets.The existing PSS schemes are almost based on linear SS but no Chinese Remainder Theorem(CRT)-based PSS scheme was proposed.This paper proposes a PSS scheme based on CRT for integer ring to analyze the reason why traditional CRT-based SS is not suitable to design PSS schemes.Then,an ideal PSS scheme based on CRT for polynomial ring is also proposed.The scheme utilizes isomorphism of CRT to implement efficient share refreshing.