Existence of multiplicative secret sharing schemes with polynomial share expansion

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Giovanni di Crescenzo Computer Science Department, University of California at San Diego, La Jolla, CA
Yair Frankel CertCo, 55 Broad Street, New York, NY
Published in:
· Proceeding
SODA '99 Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Pages 895-896
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1999
table of contents ISBN:0-89871-434-6
Existence of multiplicative secret sharing schemes with polynomial share expansion 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 295
· Citation Count: 1


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