R. Gennaro, Y. Ishai, E. Kushilevitz and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proceedings of the 33rd ACM Symp. on Theory of Computing (STOC '01), pages 580-589, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Linear VSS and Distributed Commitments Based on Secret Sharing .. - Fehr, Maurer (2002) (5 citations) (Correct)
....DC scheme can be proven by a simple linear algebra argument even with respect to a mixed adversary which strictly generalizes the results of [5] and characterize the general adversary condition under which a secure VSS scheme exists. For the BGW VSS scheme, as well as the 4 round version of [9], we show that some of the checks between players are superfluous, i.e. the scheme is not optimal. This also shows that arguing about the security of such schemes becomes conceptually simpler. Finally, our approach, establishing the minimal conditions for security, can lead to the design of ....
....during the execution, without revealing any information about the shared secret. The concrete choice of the protocol is somewhat arbitrary, in that it can be modified in different ways without loosing its functionality and without nullifying the upcoming results. For instance, techniques from [9] can be applied to improve the round complexity (at the cost of an increased communication complexity) and some secret sharing schemes M allow early stopping . Protocol Share (M; C (k) 1. The dealer chooses a random x 2 V such that h ; xi = k, computes s = Mx and sends to every player p i 2 ....
[Article contains additional citation context not shown here]
R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd Annual ACM Symposium on the Theory of Computing. ACM Press, 2001.
Constant-Round Multiparty Computation Using a Black-Box.. - Damgård, Ishai (2005) Self-citation (Ishai) (Correct)
No context found.
R. Gennaro, Y. Ishai, E. Kushilevitz and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proceedings of the 33rd ACM Symp. on Theory of Computing (STOC '01), pages 580-589, 2001.
Perfect Constant-Round Secure Computation via Perfect.. - Ishai, Kushilevitz (2002) (2 citations) Self-citation (Ishai Kushilevitz) (Correct)
....match or beat their previous non perfect (information theoretic) counterparts in every efficiency aspect. 1. 2 Our Results We present two main constructions of perfect randomizing polynomials, which in turn can be transformed via general purpose protocols for perfectly secure computation (e.g. [6, 11, 14]) to perfect constant round protocols. This transformation is outlined in Section 2.3. The communication complexity of the resultant protocols is proportional to the complexity of the underlying randomizing polynomials. Their exact number of rounds depends on the specific notion of security. For ....
....rounds depends on the specific notion of security. For instance, t security against a passive adversary can be achieved in 2 rounds if t k 3 or in 3 rounds if t k 2 (see [19] and t security against an active adversary can be achieved in 3 rounds with t (k) using a 2 round VSS protocol from [14] (assuming a broadcast channel is available) From now on, we describe the results in terms of randomizing polynomials and do not spell out the specific consequences for constant round secure computation. A combinatorial construction. Our first construction of perfect randomizing polynomials is ....
R. Gennaro, Y. Ishai, E. Kushilevitz and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proc. 33rd STOC, 2001.
On Expected Constant-Round Protocols for Byzantine Agreement - Katz, Koo (2006) (Correct)
No context found.
R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd Annual ACM Symposium on Theory of Computing (STOC), 2001.
Secure Multi-Player Protocols: Fundamentals, Generality, and.. - Fehr (2003) (Correct)
No context found.
Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, and Tal Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd Annual ACM Symposium on Theory of Computing (STOC), 2001.
Deception in Electronic Auctions - Brandt (2003) (Correct)
No context found.
R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pages 580--589. ACM Press, 2001.
Round Efficiency of Multi-Party Computation with a.. - Katz, Ostrovsky, Smith (2003) (Correct)
No context found.
R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd ACM Symposium on the Theory of Computing, June 2001.
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (7 citations) (Correct)
No context found.
R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. 33rd ACM Symposium on Theory of Computing (STOC), ACM, pp. 580--589, 2001.
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (7 citations) (Correct)
No context found.
R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. 33rd ACM Symposium on Theory of Computing (STOC), ACM, pp. 580--589, 2001.
Round Efficiency of Multi-Party Computation with a.. - Katz, Ostrovsky, Smith (Correct)
No context found.
R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd ACM Symposium on the Theory of Computing, June 2001.
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