Secret-Sharing Schemes: A Survey

Carlo Blundo, Alfredo De Santis, Ugo Vaccaro

Svetla Nikova⋆, Ventzislav Nikov

The goal of this paper is to present a survey on certain recent developments in the theory of unconditional Multi Party Computation (MPC) and Secret Sharing Schemes (SSS) related to Error Correcting Codes.

K.G. Parvatov

Jingyu Chen, Haitao Deng, Huachang Su +2 more

As the most popular cryptographic scheme in the post-quantum field, lattices have received extensive attention and research. Not only do they provide quantum-resistant security, they also enable the construction of complex applications. Currently, lattice cryptography schemes based on different difficult problems have been applied in different fields. The threshold secret sharing (TSS) scheme is an important field of cryptography and has important application value and development prospects in key protection, secure multi-party computation, privacy protection, etc. However, with the rapid development of quantum computing, many existing cryptography-underlying technologies are facing huge difficulties and challenges. Therefore, post-quantum TSS has important research significance and value for the future development of cryptography. In this paper, we summarize the existing secret sharing schemes based on lattice-hard problems and the relevant applications of these schemes in the post-quantum realm. We classify existing lattice-based TSS according to different functions and introduce typical solutions. To the best of our knowledge, this is the first review paper on lattice-based TSS schemes.

Carlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo +2 more

Ryutaroh Matsumoto

The common goal of (classical) secure net- work coding and quantum secret sharing is to encode secret so that an adversary has as little information of the secret as possible. Both can be described by a nested pair of classical linear codes, while the strategies available to the adversary are di erent. The security properties of both schemes are closely related to combinatorial properties of the underlying linear codes. We survey connections among them.