Confirmer signature algorithm based on weak trust relation
Ping Li · Jisuanji gongcheng yu sheji · 2007
Based on the assumption that only weak-trusted relation exists among the participants,designated confirmer signatures in weak-trusted relation has the following security requirements: Process separated between signature construction and verification,zero-knowledge proofs,un-transformability and fakery prevention.A confirmer signature algorithm based on RSA public-key cryptography is proposed,and verification processes are presented,described both in non-formal method and in Camenisch-Michels model.The security of this algorithm is proved to be equivalent to RSA cryptographic functions.