Secret sharing is mainly used for multi-party secure computing, secure storage and secure communication. Homomorphic encryption is mainly used for cloud computing, blockchain and data privacy protection.

The idea of homomorphic encryption originates from private homomorphism, and algebraic homomorphism and arithmetic homomorphism are subsets of private homomorphism.

Partial homomorphism can be multiplied and added, but no function can be calculated. Fully homomorphic encryption can perform any homomorphic operation on ciphertext infinitely, that is to say, any function can be homomorphic.

Homomorphic encryption is a special encryption method, and the result obtained by special operation after encrypting plaintext is the same as that obtained by special processing of encrypted plaintext.

Homomorphic encryption is a data encryption method, which is characterized by allowing data to achieve mathematical or logical operations under encryption. Homomorphic encryption is usually asymmetric encryption. So before introducing homomorphic encryption, let's briefly introduce asymmetric encryption.

Homomorphic encryption is a form of encryption, which allows people to perform a specific algebraic operation on ciphertext to get an encrypted result, and the result obtained by decryption is the same as that obtained by performing the same operation on plaintext.

Introduction to homomorphic encryption

Homomorphic encryption is a data encryption method, which is characterized by allowing data to achieve mathematical or logical operations under encryption. Homomorphic encryption is usually asymmetric encryption. So before introducing homomorphic encryption, let's briefly introduce asymmetric encryption.

(1) cryptography and its applications include public key cryptosystem, homomorphic encryption system, combined public key, quantum cryptography, trusted computing, trusted access control, threshold signcryption, multi-party authentication, HECC and double-line pairing, formal analysis of multi-party security protocols, temporal logic and model checking, etc.

FeldmanVSS is a common verifiable secret sharing scheme, which was proposed by PaulFeldman (see his paper: "Practical Scheme of Non-interactive Verifiable Secret Sharing"). It combines homomorphic encryption scheme and Shamir's secret sharing.

Homomorphic encryption is very effective because

1. Homomorphic encryption is more efficient than other mainstream encryption methods. The answer to this question is correct.

2. Using homomorphic encryption technology, the decryptor can only know the final result, but can't get every piece of ciphertext information, which can improve the security of information. It is precisely because of the advantages of homomorphic encryption technology in computational complexity, communication complexity and security that more and more research forces are devoted to exploring its theory and application.

Homomorphic encryption is a form of encryption, which allows people to perform a specific algebraic operation on ciphertext to get an encrypted result, and the result obtained by decryption is the same as that obtained by performing the same operation on plaintext.

4. Homomorphic encryption is a special encryption method. The result obtained by special operation after encrypting plaintext is the same as that obtained by special processing of encrypted plaintext.

5. What homomorphic encryption can do, so can full homomorphic encryption; However, full homomorphic encryption generally has a large computational overhead, so it is not necessary to choose full homomorphic encryption when some homomorphic encryption schemes are sufficient; It is more difficult to design a fully homomorphic encryption protocol than to design a partially homomorphic encryption algorithm.

What is the principle of homomorphic encryption? What is the application in practice?

1, homomorphic encryption is a form of encryption, which allows people to perform a specific algebraic operation on ciphertext to get an encrypted result, and the decrypted result is the same as that obtained by performing the same operation on plaintext.

2. Homomorphic encryption is a data encryption method, which is characterized by allowing data to perform mathematical or logical operations in the encrypted state. Homomorphic encryption is usually asymmetric encryption. So before introducing homomorphic encryption, let's briefly introduce asymmetric encryption.

3. Homomorphic encryption is more efficient than other mainstream encryption methods. The answer to this question is correct.

4. Homomorphic encryption Differential privacy homomorphic encryption is gradually considered as a feasible method to realize secure multi-party computing in PPML. Letting means using an encryption function as the encryption key. Let represent plaintext space and ciphertext space.

5. Homomorphic encryption provides the function of processing encrypted data. In other words, others can process the encrypted data, but the process will not reveal any original content. At the same time, after the user who owns the key decrypts the processed data, what he gets is the processed result.

6. In the context of homomorphic encryption, power operation is the multiplication of encrypted values. We can apply the same structure in the case of a simple single-coefficient polynomial: this structure restricts the prover to use only the provided encryption S, so the prover can only assign the coefficient c to the polynomial provided by the verifier.

Please ask the great god to answer what homomorphic encryption is, Baidu can't understand it.

Homomorphic encryption is a data encryption method, which is characterized by allowing data to achieve mathematical or logical operations under encryption. Homomorphic encryption is usually asymmetric encryption. So before introducing homomorphic encryption, let's briefly introduce asymmetric encryption.

The idea of homomorphic encryption originates from private homomorphism, and algebraic homomorphism and arithmetic homomorphism are subsets of private homomorphism.

Homomorphic encryption is a form of encryption, which allows people to perform a specific algebraic operation on ciphertext to get an encrypted result, and the result obtained by decryption is the same as that obtained by performing the same operation on plaintext.

What is the difference between full homomorphic encryption and partial homomorphic encryption?

1, differential privacy homomorphic encryption is gradually considered as a feasible method for PPML to realize secure multi-party computing. Letting means using an encryption function as the encryption key. Let represent plaintext space and ciphertext space.

2. Homomorphic encryption is more efficient than other mainstream encryption methods. The answer to this question is correct.

Homomorphic encryption is a form of encryption, which allows people to perform a specific algebraic operation on ciphertext to get an encrypted result, and the result obtained by decryption is the same as that obtained by performing the same operation on plaintext.

4. Homomorphic encryption is a special encryption method. The result obtained by special operation after encrypting plaintext is the same as that obtained by special processing of encrypted plaintext.

5. Homomorphic encryption is a data encryption method, which is characterized by allowing data to perform mathematical or logical operations in the encrypted state. Homomorphic encryption is usually asymmetric encryption. So before introducing homomorphic encryption, let's briefly introduce asymmetric encryption.