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

in a multi-secret sharing scheme, several secret values are distributed among a set of n participants.in 2000 chien et al.'s proposed a (t; n) multi-secret sharing scheme. many storages and publicvalues required in chien's scheme. motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the lagrange interpolation formula for polynomials andcip...

While classically cryptography is concerned with the problem of private communication among two entities, say players, in modern cryptography multi-player protocols play an important role. And among these, it is probably fair to say that secret sharing, and its stronger version verifiable secret sharing (VSS), as well as multi-party computation (MPC) belong to the most appealing and/or useful o...

(t, n) threshold secret sharing is a cryptographic mechanism to divide and disseminate information among n participants in a way that at least t(t ≤ n) of them should be present for the original data to be retrieved. This has practical applications in the protection of secure information against loss, destruction and theft. In this study, the authors propose a new multi-secret sharing scheme wh...

With the rapid advancement and wide application of blockchain technology, consensus protocols, which are core part systems, along with privacy issues, have drawn much attention from researchers. A key aspect in is sensitive content transactions permissionless blockchain. Meanwhile, some applications, such as cryptocurrencies, based on low-efficiency high-cost may not be practical feasible for o...

We show that if a set of players hold shares of a value a ∈ Zp for some prime p (where the set of shares is written [a]p), it is possible to compute, in constant round and with unconditional security, sharings of the bits of a, i.e. compute sharings [a0]p, . . . , [a`−1]p such that ` = dlog 2 (p)e, a0, . . . , a`−1 ∈ {0, 1} and a = ∑`−1 i=0 ai2 . Our protocol is secure against active adversarie...

In this thesis we study a problem of doing Verifiable Secret Sharing (VSS) and Multiparty Computations (MPC) in a model where private channels between the players and a broadcast channel is available. The adversary is active, adaptive and has an unbounded computing power. The thesis is based on two papers [CDD00, CDD99]. In [CDD00] we assume that the adversary can corrupt any set from a given a...

2-level shared secret schemes are defined by Simmons in 1989. In this paper, we describe a survey of 2-level secret sharing schemes using finite geometry.

Combining the advantages of WLANs and ad hoc networks, wireless mesh networks (WMNs) are wireless access networks based on IP technologies and have become effective broadband access networks with high capacity, high speed and wide coverage. Security is a crucial and urgent problem in WMNs as in other types of networks and a simple and effective distributed key management is essential for the es...

Ciphertext policy attribute based encryption (CP-ABE) is a technique in which a user with a secret key (containing attributes) is able to decrypt a message only if the attributes in the policy match those defined in the secret key. The existing methods that use reasonably computable decryption policies for CP-ABE, produce the ciphertext of size at least linearly varying with the number of attri...