S. Dziembowski. On the complexity of verifiable secret sharing and multiparty computation. In STOC, pages 325--334, 2000. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Secure Multi-party Computation for selecting a solution according .. - Silaghi (2004) (Correct)
No context found.
S. Dziembowski. On the complexity of verifiable secret sharing and multiparty computation. In STOC, pages 325--334, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC