Efficient (k, n) Secret Sharing Scheme Secure against k — 2 Cheaters

Simple Approach to Realizing Verifiable Secret Sharing for Secure Cloud System

“…In this section, we review the known works for realizing verifiable secret sharing, in particular, detection and identification of malicious actions. Some methods for realizing verifiable secret sharing include the process of using additional data called an authenticator that has a specific relationship with the secret input (hereinafter referred to as the authenticator method) [5]- [8], [10]- [13], the method of detecting and correcting false shares (or errors) using Reed-Solomon code (referred to as the RS method) [14], and a method that can verify the reconstructed result using only the distributed shares (for example, Harn et al's method [20]), etc.…”

A method for degradation prediction based on Hidden semi-Markov models with mixture of Kernels

“…For solving the high computational complexity of HSMM, Liu et al (2012) further utilized the sequential Monte Carlo method to approximate posterior probability in training and decoding. Zhu and Liu (2017) developed a forward-only algorithm to train HSMM for online tool wear estimation. Among the research of this area, a type of 3-State HSMM with Erlang distributions of state duration, fixed state transition probability, and Mixture of Gaussians of observations, called MoG-HSMM, is widely applicable for its simplicity.…”