In this paper we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis we propose a new scheme for quantum secret sharing (QSS). Our QSS scheme is quite general and cost efficient compared to other schemes. In our scheme no joint quantum...

THRESHOLD CRYPTOGRAPHY WITH CHINESE REMAINDER THEOREM Kamer Kaya Ph.D. in Computer Engineering Supervisor: Asst. Prof. Dr. Ali Aydın Selçuk August, 2009 Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements of the area. However, no ...

Secret sharing is one of the branches of threshold cryptography. Secret sharing is intended to secure a secret key s among a group G with n participants. Thus, the secret key s can be reconstructed by collecting shares of t or more participants. Recently, the secret sharing concept has been applied in securing DNSsec root key. However, the idea of DNSsec root key security is based on Shamir’s (...

Secret sharing schemes are methods for distributing a secret among n participants in such a way that any qualified subsets of participants can recover the secret, and unqualified participants can not. In 1979, secret sharing schemes were first independently introduced by Blakley and Shamir. In 1987, Feldman proposed a verifiable secret sharing scheme based on Shamir’s Scheme, that every partici...

A disjunctive multi-level secret sharing scheme divides users into different levels. Each level L is associated with a threshold tL, and a group of users can only recover the secret if, for some L, there are at least tL users at levels 0....L in the group. We present a simple ideal disjunctive multi-level secret sharing scheme – in fact, the simplest and most direct scheme to date. It is the fi...

A threshold scheme is a system that protects a secret (key) among a group of participants in such a way that it can only be reconstructed from the joint information held by some predetermined number of these participants. In this paper we extend this problem to one where there is more than one secret that participants can reconstruct using the information that they hold. In particular we consid...

A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes. To this en...

Considering the case of players’ deceptions, traditional secret sharing scheme can not resolve the security issues. To address these security issues, the paper proposes a rational secret sharing scheme against cheating based on game theory. Under the conditions of the rational, applying the idea of threshold, the scheme is composed of key generation, share encryption, verification and secret re...

Threshold secret sharing schemes are used to divide a given secret by a dealer in parts such that no less than the threshold number of shareholders can reconstruct the secret. However, these schemes are susceptible to the malicious behavior of a shareholder or a dealer. To prevent such attacks, it is necessary to make a provision for verification of the integrity of the shares distributed by th...

Many efficient secret sharing schemes for general access structures have been developed in efforts to deal with the problems of multi-party computations (MPC), threshold cryptography, and access control. In this paper, we have proposed a novel secret sharing scheme with general access structures that is based on the key-lock-pair mechanism. In our scheme, the dealer can assess a real situation ...