Photo by Glenn Carstens-Peters on Unsplash

Camenisch-Shoup Verifiable Encryption using Kryptology and Golang

So Alice has some ciphertext. How does Bob prove to Alice that he has used a certain key to encrypt the message? Well, one way is for Bob to provide a Non-interactive Zero-Knowledge Proof (NIZK), and which will not only prove the party who encrypted the message but also the party who has the secret key.