Verifiable secret sharing and multiparty protocols with honest majority

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: T. Rabin Institute of Mathematics and Computer Science, The Hebrew University, Jerusalem, Israel
M. Ben-Or Institute of Mathematics and Computer Science, The Hebrew University, Jerusalem, Israel
Published in:
· Proceeding
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pages 73-85
ACM New York, NY, USA ©1989
table of contents ISBN:0-89791-307-8 doi>10.1145/73007.73014
Verifiable secret sharing and multiparty protocols with honest majority Published by ACM 1989 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 140
· Downloads (cumulative): 1,964
· Citation Count: 235


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