... h (·) and MAC(·) are randomoracles.Proof Adversary ATPAis allowed to access the oracles,SO, CO, FRO, SRO, SKO. Let the maximum number of queries be q times and the size of secret ... protocol, if q≪ 2n and h(·), MAC(·) are random oracles. Due tospace limitations, we omit the detailed proof, as it isalmost similar to the Ohkubo et al.’s proof method (seeProofs 1 ~ 4 of Appendix) ... computation and update cost:Asecurityproto col should result in low computation cost. Dueto limited resources, on one hand, complex compu-tations will fail in the hand-held device of a mobileuser and, ...