# Proof in “New Multi-Signatures in the Plain Public-key Model and a General Forking lemma”

Reading here,I was confused in the proof of "A Multi-Signature Scheme based on Discrete Logarithms" proposed by authors.I felt strange to the technique(using array $$T_0[]$$$$T_1[]$$$$T_2[]$$ and state $$alert$$$$bad$$)，can someone give me a straightforward explain of this proof(or some similar proofs of other schemes)?