I have a doubt regarding the definition of (static) semi-honest adversaries. In this tutorial I read:
Such an adversary controls one of the parties (statically, and so at the onset of the computation) and follows the protocol specification exactly. However, it may try to learn more information than allowed by looking at the transcript of messages that it received and its internal state.
Does it means that, for example, in the case of a commitment scheme a semi-honest adversary, who controls the party supposed to commit a value, knows the committed value (since it is part of her or his internal state)? However, since the adversary is semi-honest, she or he cannot take advantage of this information to deviate from the protocol in a profitable way.