Escure Signature Schemes based on Interactive Protocols

摘要: Given only an interactive protocol of a certain type as primitive, we can build (non-interactive) signature scheme that is secure in the strongest sense Goldwasser, Micali and Rivest (see [11]): not existentially forgeable under adaptively chosen message attacks. There are numerous examples primitives satisfy our conditions, e.g. Feige-Fiat-Shamir, Schnorr, Guillou-Quisquater, Okamoto Brickell-Mc.Curley ([9], [17], [12], [15], [3]).A main consequence efficient schemes now also be based on computationally difficult problems other than factoring [11]), such discrete logarithm problem.In fact, existence one-way group homomorphisms sufficient assumption to support construction. As demonstrate construction claw-free pairs trapdoor permutations, results viewed generalization [11].