Adaptively secure multi-party computation
Ran Canetti, Uri Feige, Oded Goldreich, Moni Naor · 1996
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries (i.e., adversaries that may choose the corrupted parties during the course of the computation), in a setting where the channels are insecure and secure communication is achieved by cryptographic primitives based on the computational limitations of the adversary.