Fast Private Set Intersection from Homomorphic Encryption

wzh

5/30/24, 8:08 AM

I encountered a question while reading an article. My understanding is that fully homomorphic encryption supports ciphertext addition and multiplication. Why does the basic protocol given in this article include ciphertext subtracted by plaintext?

1 + 0

homomorphic-encryption

private-set-intersection

Score:1

Crypto

Sacha Servan-Schreiber

5/30/24, 10:51 AM

In FHE schemes, an operation between a plaintext and a ciphertext can be performed by first encrypting the plaintext using the scheme's public key and then evaluating the corresponding operations (e.g., ADD or MULT) over ciphertexts.

However, because the plaintext is "known" (in this case it is known to the sender), in many cases it is not necessary to compute a random ciphertext, which can be more efficient in practice.

+ 0

Elon Musk

I sit in a Tesla and translated this thread with Ai:

EN: Fast Private Set Intersection from Homomorphic Encryption

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.