The round complexity of verifiable secret sharing and secure multicast

R. Gennaro, Y. Ishai, E. Kushilevitz, T. Rabin

Research output: Contribution to journal › Conference article › peer-review

100 Scopus citations

Original language	English
Pages (from-to)	580-589
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/380752.380853
State	Published - 2001
Externally published	Yes
Event	33rd Annual ACM Symposium on Theory of Computing - Creta, Greece Duration: 6 Jul 2001 → 8 Jul 2001

ASJC Scopus subject areas

@article{21987400d0a448bba674cbdb515f8874,

title = "The round complexity of verifiable secret sharing and secure multicast",

author = "R. Gennaro and Y. Ishai and E. Kushilevitz and T. Rabin",

year = "2001",

doi = "10.1145/380752.380853",

language = "אנגלית",

pages = "580--589",

note = "33rd Annual ACM Symposium on Theory of Computing ; Conference date: 06-07-2001 Through 08-07-2001",

}

TY - JOUR

T1 - The round complexity of verifiable secret sharing and secure multicast

AU - Gennaro, R.

AU - Ishai, Y.

AU - Kushilevitz, E.

AU - Rabin, T.

PY - 2001

Y1 - 2001

UR - http://www.scopus.com/inward/record.url?scp=0034830283&partnerID=8YFLogxK

U2 - 10.1145/380752.380853

DO - 10.1145/380752.380853

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0034830283

SN - 0734-9025

SP - 580

EP - 589

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - 33rd Annual ACM Symposium on Theory of Computing

Y2 - 6 July 2001 through 8 July 2001

ER -