This paper discusses an implicit security algorithm for secure transmission using multiple paths between sender and receiver, secure cloud storage, in a peer-to-peer network and secret sharing applications. The proposed algorithm modifies Shamir's secret sharing scheme such that a group of k-2 or fewer colluding nodes gain only negligible advantage against the honest node. Further, the proposed modifications do not require any additional storage. Here k is the minimum number of nodes that have to pool their partitions together to reconstruct the secret.
['Abhishek Parakh']
Cheating Resistant Implicit Security