Imagine multiple parties executing a secure multiparty computation protocol to evaluate a function securely. Let Alice be one of the parties who is intended to get all the partial results and combine these partial results into complete result at the end of the protocol.
In practice , if Alice's machine is compromised and the attacker is impersonating Alice and he has the complete results at the end of the protocol, what kind of adversary would he be in theory ?
Attacker is not passive adversary, he is not eaves dropping all the parties.
Is attacker an active adversary ( or byzantine adversary ) ? I believe active adversaries corrupt the parties to execute arbitrary/malicious code etc. But here attacker is not corrupting the parties to do some computation of his choice rather he compromised the party that is intended to get the results .
Is attacker an non-adaptive adversary ? attacker infact control only one party but he has complete results .