Multipartite secret sharing schemes are those having a multipartite access structure, in which the set of participants is divided into several parts and all participants in the same part play an equivalent role. Secret sharing schemes for multipartite access structures have received considerable attention due to the fact that multipartite secret sharing can be seen as a natural and useful generalization of threshold secret sharing. This work deals with efficient and explicit constructions of ideal multipartite secret sharing schemes. Most ideal multipartite secret sharing schemes in the literature can be classified as either hierarchical or compartmented. The main results are the constructions for ideal hierarchical access structures, a family that contains every ideal hierarchical access structure as a particular case such as the disjunctive hierarchical threshold access structure and the conjunctive hierarchical threshold access structure, the constructions for three families of compartmented access structures, and the constructions for two families compartmented access structures with compartments. We present an efficient method to construct ideal linear schemes realizing these access structures by linear algebraic techniques on the basis of the relationship between multipartite secret sharing schemes, polymatroids and matroids.
29 June 2020 in IEEE Transactions on Communications
Security challenges brought about by the upcoming 5G era should be taken seriously. Code-based cryptography leverages difficult problems in coding theory and is one of the main techniques enabling cryptographic primitives in the postquantum scenario. In this work, we propose the first efficient secure scheme based on polar codes (i.e., polarRLCE) which is inspired by the RLCE scheme, a candidate for the NIST postquantum cryptography standardization in the first round. In addition to avoiding some weaknesses of the RLCE scheme, we show that, with the proper choice of parameters, using polar codes, it is possible to design an encryption scheme to achieve the intended security level while retaining a reasonably small public key size. In addition, we also present a KEM version of the polarRLCE scheme that can attain a negligible decryption failure rate within the corresponding security parameters. It is shown that our proposal enjoys an apparent advantage to decrease the public key size, especially on the high-security level.
In this paper, we deal with the vibration control problem of a flexible spacecraft system with unknown external disturbance and uncertain input backlash non-linearity. The considered system is described by two partial differential equations and an ordinary differential equation as governing equations, and by ordinary differential equations as boundary conditions. The backlash non-linearity is reformulated into a desired control input associated with an extra input non-linear error. This input error and the external disturbance are combined into an unknown ‘disturbance-like’ item. Two boundary control inputs are designed at the center body of the spacecraft, compensating for the unknown upper-bound of such items by applying proper online updating laws. As a result, the vibration of both solar panels of the flexible spacecraft are suppressed and their angle positions are regulated in the desired region. Numerical simulations are provided to verify the control performance of the proposed controls by the choice of proper parameters.
In this paper, we present an effective code-based linkable ring signature scheme based on Borromean ring signature. The security of the scheme is based on the hardness of Syndrome Decoding problem, General Syndrome Decoding problem and Codeword Finding problem. We prove that our scheme has all the properties that a linkable ring signature scheme should have: unforgeability, anonymity, linkability and non-slanderability. Efficiency analysis shows that our scheme has a smaller signature size than the existing scheme under the same security conditions. Furthermore, this signature scheme can be easily extended to multiple layers. That is, code-based multilayer linkable ring signature scheme can be obtained and used for transactions with multiple inputs.
EHR contains detailed information about a large number of patients. In the past ten years, EHR-related research has involved various fields, and research in various fields is inseparable from the acquisition of knowledge in EHR. The rapid development of various fields in recent years has brought new challenges to the acquisition of knowledge in EHR. At the same time, the knowledge enhancement technology that has emerged in recent years has effectively improved this problem. Therefore, more and more researches personnel applied knowledge enhancement technology to EHR. In this article, we summarized the literature in this area. We first summarized the knowledge types of EHR, and then made a sub-statement on knowledge extraction and modeling. Next, the correct representation method of knowledge is given, and finally, the specific application in each field is summarized. We hope this article can continue to promote the development of knowledge enhancement technology in EHR.