Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an ...

Visual secret sharing scheme (VSSS) is a secret sharing method which decodes the secret by using the contrast ability of the human visual system. Autostereogram is a single two dimensional (2D) image which becomes a virtual three dimensional (3D) image when viewed with proper eye convergence or divergence. Combing the two technologies via human vision, this paper presents a new visual secret sh...

Presently, there is little focus on the contractual agreement, particularly production sharing agreement by International Oil Companies in exploration of petroleum resources developing countries. The primary objective this paper to critically explore contract structure production-sharing agreements and development Content analysis was used as methodology study after examining several literature...

A secret sharing scheme is a method to distribute a secret among a set of participants, such that only qualified subsets of the participants can recover the secret. A secret sharing scheme is perfect if any unqualified subset obtains no information regarding the master key. The collection of qualified subsets is called access structure. In a hypergraph, if the size of edges is equal to r, the h...

We segregate attacks into two categories – targeted and opportunistic – based on whether the attacker compromises a specific target (targeted) or a number of intermediate targets to fulfill his end goal (opportunistic). We assume that opportunistic attackers consider targets indistinguishable except for their vulnerabilities, and are interested in acquiring as many targets as possible. We there...

Mobile networks differ from their wireline counterparts mainly by the high costs for air transmissions and by the mobility of the users. A new entity, denoted as the crawling peer, is suggested in order to optimize the resource mediation mechanism for a mobile P2P file sharing application. In [1], we have investigated the performance of a crawling peer by means of simulations. Now, we show a ti...