I was reading this paper, where I came across the following statement:
We consider the problem of unbounded MPC with security against semi-malicious adversaries in the dishonest majority setting. In our communication model, parties publish their first message through a broadcast channel which is immediately delivered to all participants. At any point in time, any subset S of participants (with a dishonest majority) can gather together and evaluate a circuit C over their inputs (x_1, . . . , x _|S|) in a single round of broadcast.
Is semi-malicious similar to the augmented semi-honest model where the adversary can change inputs of the corrupted parties?