3D printing multi-database sharing optimization algorithm for single-key encryption and decryption
A key encryption, 3D printing technology, applied in the field of multi-database sharing, can solve the problems of inexhaustible 3D printing parameters, high cost of 3D printing experiments, etc., to achieve the effect of ensuring confidentiality
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0058] This embodiment describes in detail the situation that two data sample owners share the database, and at this time, the two data sample owners are denoted by A and B respectively.
[0059] Two typical structures:
[0060] The first typical structure is that A and B have some characteristics of m data samples respectively, for example: A has the characteristics of laser power and printing speed in m groups, while B has the characteristics of m groups of powder feeding volume and air feeding volume, The features owned by parties A and B are not repeated; this is a scenario where the data features of parties A and B are different. In this case, it is necessary to use the data same distribution technology to process the data samples uniformly for subsequent operations.
[0061] The second typical structure is that A has m1 data samples, B has m2 data samples, and the number of data features contained in each data sample is the same, that is, the number of data features con...
Embodiment 2
[0100] Compared with the technical solution of "homomorphically encrypting the shared data such as data samples in the sample matrix, and then performing Taylor expansion" in Example 1, encryption methods such as secret sharing and multi-party secure summation can also be used for encryption, and then no Taylor unfolded.
[0101] Other parts of this embodiment are the same as those of Embodiment 1, so details are not repeated here.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
