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...

The UIP theorem has had very little empirical support over the past 25 years. Moreover, it has been shown that high-rate currencies have tended to appreciate and low-rate currencies to depreciate, the reverse of theory. The failure of UIP has been no secret to participants in currency markets, where the carry trade, which is essentially a bet against UIP, has become a very popular investment st...

Secret sharing scheme is a method to distribute secret information to a set P of participants so that only authorised subsets of P can reconstruct the secret. A set of subsets of P that can reconstruct the secret is called an access structure of the scheme. A simple undirected graph G is called a sum graph if there exists a labeling L of the vertices of G into distinct numbers, usually positive...

We propose deceptive secret sharing, which is a novel approach to provide both confidentiality and deception in distributed storage systems. The motivation for this is to protect confidentiality as far as possible while acknowledging that no confidentiality scheme provides perfect protection. If confidentiality is breached and information is accessed by unauthorized individuals, our deceptive s...

Recently, Baghery et al. [1, 2] presented some attacks on two RFID protocols, namely Yoon and Jung et al. protocols, and proposed the improved version of them. However, in this note, we show that the improved version of the Jung et al. protocol suffers from desynchronization attack and the improved version of the Yoon's protocol suffers from secret disclosure attack. The succe...

Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention ...