Questions tagged [verifiable-encryption]

Consider the following two verifiable encryption schemes for Discrete Logarithm. FS01: “One Round Threshold Discrete-Log Key Generation without Private Channels” by Pierre-Alain Fouque and Jacques Stern, Section 3.2, "A Proof of Fairness". CS03:…

How to proof Pedersen Verifiable secret sharing using a game-based proof and reduct to the discrete logarithm problem? Are there any papers that can be referenced?

I am going over the paper https://verifiable-timed-signatures.github.io/web/assets/paper.pdf and on page 5, it says the following: Suppose I have a t-out-of-n threshold sharing scheme for the secret $\sigma=H(m)^\alpha$. The first $t-1$ shares are…

My question is about the verifiable encryption (Camenisch-Shoup). in the Paillier cryptosystem, a message $m$ is encrypted using a public key (composed of $N$ and $g$) and a random number $r$, resulting in a ciphertext $C = g^m \cdot r^N…