IDC. An adversary A is modeled by a probabilistic polynomial time Turing machine. All the communications go through the adversary A . Participants only respond to the following oracles by A and do not communication directly among themselves. A can replay, delete, modify, interleave or delete all messages follows in the system.
Appears in 2 contracts
Sources: Remote User Authentication and Key Agreement Scheme, Authentication and Key Agreement Scheme