Proactive Secret Sharing Scheme Research Articles

A Dynamic Proactive Secret Sharing Scheme for Quadratic Functions

A Dynamic Proactive Secret Sharing Scheme for Quadratic Functions

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.

A Secured Data Transmission Method using Enhanced Proactive Secret Sharing Scheme to Prevent Blackhole Attack in Manets- A Review

Mobile Ad Hoc Networks are the collection of Selforganizing, Independent nodes that can interact with one another by creating radio network. In multi-hop wireless ad hoc networks, the nodes not in direct range rely/dependent upon intermediate nodes to interact. For securing its limited resources or to organize Denial of Service (DoS) attack, the middle node for instance the intermediary node drops all the packets going through it instead to forward them to its Descendant. This review paper can deal with the misbehavior called Blackhole Attack which is one of the Security Attacks and occurs in the Network Layer. Nodes interact with each other without any access point. It is a Dynamic network having the capabilities of real time network. Due to mobility of nodes network is easily affected by many types of attacks. In particular Blackhole attack the it can cause packet dropping and misrouting the information from source to destination. To reduce the impact of this attack, the new approach has been proposed i.e. New Enhanced Proactive Secret Sharing Scheme (NEPSSS) to detect the Blackhole nodes and to verify the Data Authenticity, Data Confidentiality and Data Integrity. This proposed algorithm divided into two phases. The first phase is the Detection of Blackhole Attack achieved using Trust Active and Recommendation of the Nodes. In the second phase the New Proactive Secret Sharing Scheme is used to provide the data authenticity and data integrity. The simulation results shows that the proposed algorithm achieves the better packet delivery ratio, misbehavior detection efficiency, fewer packet overhead and low end to end delay than the existing schemes.

A Proactive Secret Sharing Scheme in matrix projection method

Proactive Secret Sharing (PSS) scheme is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme (SSS) without modifying the secret, or reconstructing the secret to reproduce new shares. Traditionally, PSS schemes are developed for the Shamir's SSS which is a single SSS. Bai (2006) developed a multiple-secret sharing scheme using matrix projection. This paper presents a distributed PSS method for the matrix projection SSS. Once the new shares are updated, adversaries cannot discover the secrets from k shares which are mixed with past and present shares.