Known Issues With Application of Forking Lemma
The reduction provided by the forking lemma is not a tight reduction. Pointcheval and Stern proposed security arguments for Digital Signatures and Blind Signature using Forking Lemma. Claus P. Schnorr provided an attack on blind Schnorr signatures schemes, which were argued to be secure by Pointcheval and Stern. Schnorr also suggested enhancements for securing blind signatures schemes based on discrete logarithm problem.
Read more about this topic: Forking Lemma
Famous quotes containing the words issues and/or application:
“Cynicism formulates issues clearly, but only to dismiss them.”
—Mason Cooley (b. 1927)
“The receipt to make a speaker, and an applauded one too, is short and easy.—Take of common sense quantum sufficit, add a little application to the rules and orders of the House, throw obvious thoughts in a new light, and make up the whole with a large quantity of purity, correctness, and elegancy of style.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)