When proving the security of a cryptographic protocol using the real-ideal world paradigm (under sequential composability only) I have seen considering corruption of parties only in the adversarial model.

However, does it make sense to consider the case in which the adversary controls the network only explicitly, i.e, none of the parties is corrupted but the adversary has some power over the network (e.g., it can read messages)?

Or, can this case be expressed in terms of corruption of parties (so it does not have to be considered explictly)?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.