On alternative approach for verifiable secret sharing

On the graph coloring check-digit scheme with applications to verifiable secret sharing

In the paper we apply graph vertex coloring for verification of secret shares. We start from showing how to convert any graph into the number and vice versa. Next, theoretical result concerning properties of n-colorable graphs is stated and proven. From this result we derive graph coloring check-digit scheme. Feasibility of proposed scheme increases with the size of the number, which digits are checked and overall probability of errors. The check-digit scheme is used to build shares verification method that does not require cooperation of the third party. It allows implementing verification st…

A Comparison of Secret Sharing Schemes Based on Latin Squares and RSA

In recent years there has been a great deal of work done on secret sharing scehemes. Secret Sharing Schemes allow for the division of keys so that an authorised set of users may access information. In this paper we wish to present a critical comparison of two of these schemes based on Latin Squares, [Cooper et., al.] and RSA [Shoup]. These two protocols will be examined in terms of their positive and negative aspects of their secuirty.

Secret sharing on the $d$-dimensional cube

We prove that for $d>1$ the best information ratio of the perfect secret sharing scheme based on the edge set of the $d$-dimensional cube is exactly $d/2$. Using the technique developed, we also prove that the information ratio of the infinite $d$-dimensional lattice is $d$.

无条件安全的不可延展秘密共享与循环外部差分族

Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families

本文提出基于博弈的不可延展秘密共享新定义，通过引入新型AMD码构造了针对特定关系的无条件安全门限方案，并给出了外部差分族新变体实例。

A Characterization of Ideal Weighted Secret Sharing Schemes

Beimel, Tassa and Weinreb (2008) and Farras and Padro (2010) partially characterized access structures of ideal weighted threshold secret sharing schemes in terms of the operation of composition. They classified indecomposable ideal weighted threshold access structures, and proved that any other ideal weighted threshold access structure is a composition of indecomposable ones. It remained unclear which compositions of indecomposable weighted threshold access structures are weighted. In this paper we fill the gap. Using game-theoretic techniques we determine which compositions of indecomposable…

On ASGS framework: general requirements and an example of implementation

In the paper we propose general framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying secret sharing scheme. ASGS allows to prevent the dealer from knowing the secret or even to eliminate him at all. Two situations are discussed. First concerns simultaneous generation and sharing of the random, prior nonexistent secret. Such a secret remains unknown until it is reconstructed. Next, we propose the framework for automatic sharing of a known secret. In this case the dealer does not know the secret and the secret owner does not know the shares. We pr…