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 Summary Related Articles Check |
This paper is cited in the following contexts:
Approximate Quantum Error-Correcting Codes - Crepeau, Gottesman, Smith (1 citation) (Correct)
....scheme using a classical authentication scheme. Of course, this requires further classical keys; in particular, we introduce one for each ordered pair of distinct registers, and use all the keys # ij to authenticate share j. Note that this construction is essentially a simplification of those in [13, 7]. They essentially produced approximate error correcting codes for classical data, on the way to building multi party computing protocols. Let be a QECC that can correct d 1 n 2 arbitrary erasure errors: n, k, d] Such a code can be constructed over sufficiently large dimension Q; ....
R. Cramer, I. Damgard, S. Dziembowski, M. Hirt and T. Rabin. Efficient Multiparty Computations with Dishonest Minority In Proc. of EUROCRYPT 1999.
Traffic Analysis Attacks and Trade-Offs in Anonymity.. - Back, Möller, Stiglic (2001) (10 citations) (Correct)
....2 Chaum argues that DC nets are efficient in a ring topology, which can be found on some local networks, but does not exist in large scale networks such as the Internet. Secure multi party computations 3 are a related problem that has received considerable attention ( 13] 11] 27] [7]) A multi party computation protocol can be used to hide participants communication partners ( 24] But general multi party computations are inefficient in practice with regards to communication complexity, and most solutions rely on the existence of a synchronous network and are often not ....
CRAMER, R., DAMG ARD, I., DZIEMBOWSKI, S., HIRT, M., AND RABIN, T. Efficient multiparty computations with dishonest minority. In Advances in Cryptology--- EUROCRYPT 99 (March 1999), vol. 1561 of Lecture Notes in Computer Science, SpringerVerlag, pp. 311--326.
Computations With a Deck of Cards - Stiglic (Correct)
....here means that a player does not get to know any more information than what he can deduce from his own input and the result of the function. We assume here that the participants always follow the protocol, in an other case a more specific definition of security must be provided (see [5] and [2] for example) Also, if a group of participants decide to collide together, they must form a minority of the total number of participants. As mentioned in [3] and [6] we can use the tools presented here to enable multiparty computations of any Boolean function. We simply publicly describe a ....
R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Advances in Cryptology--- EUROCRYPT 99, volume 1561 of Lecture Notes in Computer Science, pages 311-- 326. Springer-Verlag, March 1999.
The Round Complexity of Verifiable Secret Sharing.. - Gennaro, Ishai.. (2001) (8 citations) Self-citation (Rabin) (Correct)
....to a common broadcast channel, which allows each player to send a message to all players and ensures that the received message is identical. This private channels with broadcast scenario is a standard model for secure multi party computation in the information theoretic setting (see, e.g. [7, 17, 41, 2, 20, 21]) Without broadcast, even the simplest secure computation tasks cannot be solved in a constant number of rounds Number of rounds Security Efficient Optimal rounds Optimal security 1 t = 1, n 4 Yes Yes Yes 2 n 4t Yes Yes Yes 3 n 3t No Yes Yes 4 n 3t Yes Yes Table 1: Summary of ....
....somewhat lower in the rounds hierarchy than VSS. Number of rounds Security Efficient Optimal rounds Optimal security 2 n 4t or jM j 3t Yes Yes Yes 3 n = t Yes Yes Yes Table 2: Summary of Secure Multicast Bounds Previous Work. There is an extensive literature on VSS protocols [30, 7, 17, 22, 23, 24, 40, 20, 21, 19]. In our model (i.e. where there are private channels plus broadcast and no probability of error) the best known protocol was the one proposed in [7] referred to as the BGW protocol in the sequel. See [21] for a slight optimization of this protocol. This protocol applies to the case n 3t ....
[Article contains additional citation context not shown here]
R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Eurocrypt '99, pp. 311--326. LNCS No. 1592.
Adaptive Security for Threshold Cryptosystems - Canetti, Gennaro, Jarecki.. (1999) (22 citations) Self-citation (Rabin) (Correct)
No context found.
R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Eurocrypt '99, pages 311--326, 1999. LNCS No. 1592.
General Adversaries in Unconditional Multi-Party Computation - Fitzi, Hirt, Maurer (1999) (3 citations) Self-citation (Hirt) (Correct)
No context found.
R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Advances in Cryptology --- EUROCRYPT '99, Lecture Notes in Computer Science, 1999.
Multiparty computation unconditionally secure against Q² .. - Smith, Stiglic (1998) (3 citations) (Correct)
No context found.
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.
Secure Multi-Party Computation Made Simple - Ueli Maurer Department (5 citations) (Correct)
No context found.
R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multi-party computations with dishonest minority. Advances in Cryptology --- EUROCRYPT '99, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1592, pp. 311--326, 1999.
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