R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. To appear in EUROCRYPT '99. Original version written Oct. 1998. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Approximate Quantum Error-Correcting Codes - Crepeau, Gottesman, Smith (1 citation) (Correct)
Traffic Analysis Attacks and Trade-Offs in Anonymity.. - Back, Möller, Stiglic (2001) (10 citations) (Correct)
Computations With a Deck of Cards - Stiglic (Correct)
Multiparty computation unconditionally secure against Q² .. - Smith, Stiglic (1998) (3 citations) (Correct)
Secure Multi-Party Computation Made Simple - Ueli Maurer Department (5 citations) (Correct)
The Round Complexity of Verifiable Secret Sharing.. - Gennaro, Ishai.. (2001) (8 citations) Self-citation (Rabin) (Correct)
Adaptive Security for Threshold Cryptosystems - Canetti, Gennaro, Jarecki.. (1999) (22 citations) Self-citation (Rabin) (Correct)
General Adversaries in Unconditional Multi-Party Computation - Fitzi, Hirt, Maurer (1999) (3 citations) Self-citation (Hirt) (Correct)
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