3

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: “Practical Verifiable Encryption and Decryption of Discrete Logarithms” by Jan Camenisch and Victor Shoup.

They both rely on Paillier Encryption and originate from around the same time.

Question: Does somebody have a deeper understanding of similarity and differences? Is one to be preferred over the other?

mti
  • 697
  • 3
  • 13

0 Answers0