 Hello everyone, my name is Fan Sang. Today, I'm happy to introduce our work, share and transformation, and this art majority NPC with practically sharing. This is a joint work with Vypogoya and Antigone Polychroneado. In this work, we consider the design majority setting and the information theoretic security. To overcome the known impossibility results, we consider the preprocessing model. When people talk about this art majority, they usually assume that all but one party are corrupted. Our motivation is to study an intermediate case between art majority and all but one corruption, say a small constant fraction of parties are honest. This can be motivated by the fact that protocols that are secure against art but one corruption are less efficient than protocols in the art majority setting. However, the requirements of art majority can be too strong to be met for real-world applications. If there is no art majority, but a small constant fraction of parties are honest, can be speed up the protocol in such a setting. A similar scenario in the art majority setting has been well-studied in recent years. In short, when we move from the standard art majority setting to the suboptimal corruption that showed, we can reduce the communication complexity by a factor of n. In this art majority setting, the best known result speed achieves out of three times n elements of both preprocessing data and the communication. When moving to the suboptimal corruption setting, can we reduce the amount of preprocessing data and online communication by a factor of n, just as that in the art majority setting? In this work, we answer this question affirmatively by showing an MPC protocol with overall cost out of C in both the amount of preprocessing data and the communication complexity. Our idea is to use packed secret shareings to evaluate a single circuit. We rely on two new techniques, sharing transformation and sparse the packed semi-secret sharing scheme. Confidently, we consider the following problem. Given two linear secret sharing schemes and the linear function, suppose all parties hold a sharing X of the first secret sharing scheme with secret S, we want to transform it to a sharing Y of the second secret sharing scheme with secret FS. Informally, we want to transform one sharing to another one and apply a linear function on the secret. Sharing transformation occurs frequently in designing MPC protocols, such as doing degree reduction in BGW and DN-style protocols, converting encodings of secrets when using reverse multiplication-friendly embeddings, performing permutations and bound operations for secrets of a packed secret sharing. Previous solutions achieve linear communication in the number of parties only when the same sharing transformation is performed multiple times. This is sufficient for the first two examples, since we need to perform the same transformation many times. However, for the third example, each different permutation or different pattern of found out operation correspond to a different sharing transformation. The efficiency of previous solutions degrades to being quadratic in the number of parties. Our work gives an efficient sharing transformation protocol which can perform other different sharing transformations with linear amortized communication complexity in the number of parties. To achieve our results, we first reduce the problem to repair random sharing for different linear secret sharing schemes. Then we view the sampling process of each secret sharing scheme as a linear circuit and use packed secret sharing to evaluate a batch of sampling circuits in parallel. Our second technique is sparsely packed in your sharing. Our idea is to use different secret thoughts to store secrets in different sharing. For example, here we may use positions one, three, and five to store secrets. This is different from the standard packed sharing shareings which always use positions one, two, and three to store secrets. Combining these two techniques, we show how to solve network routing which is the main difficulty of using packed secret shareings to evaluate a single circuit. Our work also shows how to relax the requirement of the field site, achieve linear security and connect to the standard art majority setting. For more details about our techniques, please refer to the full video and our paper on e-print. Thank you.