The round complexity of verifiable secret sharing and secure multicast

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Rosario Gennaro
Yuval Ishai
Eyal Kushilevitz
Tal Rabin
The round complexity of verifiable secret sharing and secure multicast Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 45
· Downloads (cumulative): 638
· Citation Count: 32

Published in:
· Proceeding
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Pages 580 - 589
ACM New York, NY, USA ©2001
table of contents ISBN:1-58113-349-9 doi>10.1145/380752.380853

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder