You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is it possible to create a zero knowledge proof that a secret has been encrypted and not some "garbage"?
Example: We want to reveal a secret key for a given public key after time T. We use timelock to encrypt the secret. Is it possible to prove to someone (without revealing the secret) that the secret key was encrypted with timelock for the corresponding public key?
The text was updated successfully, but these errors were encountered:
It's a current research problem for us but we haven't put much time into it. It should in principle be possible, though the resulting circuits might be quite complicated.
If you're interested in working on it, we'd love to help!
Is it possible to create a zero knowledge proof that a secret has been encrypted and not some "garbage"?
Example: We want to reveal a secret key for a given public key after time T. We use timelock to encrypt the secret. Is it possible to prove to someone (without revealing the secret) that the secret key was encrypted with timelock for the corresponding public key?
The text was updated successfully, but these errors were encountered: