Mastermind game is a two players zero sum game of imperfect information. The first player, called “codemaker”, chooses a secret code and the second player, called “codebreaker”, tries to break the secret code by making as few guesses as possible, exploiting information that is given by the codemaker after each guess. In this paper, we consider the so called Black-Peg variant of Mastermind, wher...

A secret sharing scheme is a method of distributing a secret value among members of a group such that only certain coalitions of these participants can find the secret. A subset of users that can recover the secret is called a qualified coalition, and the set of all qualified coalitions is called the access structure. An access structure is called monotone if every coalition containing a qualif...

A binary stream cipher, known as A5, consisting of three short LFSRs of total length 64 that are mutually clocked in the stop/go manner is cryptanalyzed. It is allegedly used in the GSM standard for digital cellular mobile telephones. Very short keystream sequences are generated from different initial states obtained by combining a 64-bit secret session key and a known 22-bit public key. A basi...

â â â  â â â â  abstract â  as the chances of a successful conclusion to the doha round of trade liberalization under the wto become increasingly problematic, so the pace of negotiating local free trade agreements (ftas) is increasing. according to the wto report, countries in the asia-pacific region are “consolidating their drive towards regionalism at an accelerated pace”. after the trade...

In this paper, we investigate a new concept, called share selectable secret sharing, where no unauthorized set can obtain information of the secret (in the information-theoretic sense) even if shares are selectable as arbitrary values which are independent of the secret. We propose two totally selectable (i.e., all users’ shares are selectable) secret sharing schemes with unanimous structure. W...

Measuring development, growth and welfare is an important issue in normative and positive economics.The issue is more critical in developing economies where a good statistical indicator of income, livingstandard or poverty is crucial for decision-makers in corporate, government, non-government andinternational organizations in their for-profit or non-profit plans to promote business and trade, ...

We consider perfect verifiable secret sharing (VSS) in a synchronous network of n processors (players) where a designated player called the dealer wishes to distribute a secret s among the players in a way that no t of them obtain any information, but any t + 1 players obtain full information about the secret. The round complexity of a VSS protocol is defined as the number of rounds performed i...