Score:0

Sigma protocol for proof of encrypted content

bw flag

Suppose I have a device which encrypt my fix plaintext (On request) using Paillier algorithm. So this device every time generate a new random number (used in Paillier algorithm) and a new ciphertext (of the same palintext) will be generated. I want to know is it possible for me to proof to third one that I know the plaintext without exposing any information about the plaintext using sigma protocol($\Sigma$- protocol)?

if the answer is no pleas introduce a zero-knowledge proof for doing this task

If anyone dose not know the answer but know a zero-knowledge proof for doing this task pleas inform me

thanks

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

mangohost

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.