next up previous
Next: Sabbatical at MIT (1996-1998) Up: The First 1.5 Years Previous: Learning polynomials with queries:

Adaptively Secure Multi-party Computation

This work shows how to construct multi-party protocols that maintain their security with respect to adversaries that may adaptively corrupt a fraction of the parties during the course of the computation.


Comments: Authored by R. Canetti, U. Feige, O. Goldreich and M. Naor. Appeared in



Oded Goldreich
2003-07-30