A Radio Frequency Identification (RFID) yoking proof protocol allows a verifier to collect the evidence that two tags are simultaneously present. Yoking proof protocol has been applied in several potential applications like shipping record checking and medicine dispensation checking, etc. This paper, based on error correction codes (ECC), designs a novel yoking proof protocol, which not only protects tag's anonymity but also requires only simple operations that can be easily supported on low-cost tags. Compared to its counterparts, our scheme provides several practical merits: (1) It protects tag's anonymity using much easier approach, (2) it requires only simple operations on tags, and (3) the computational overhead on the server is much lower.