Verifiable secret sharing for monotone access structures

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Thomas Beth Universität Karlsruhe, European Institute for System Security, Am Fasanengarten 5, D-76128 Karlsruhe, Germany
Hans-Joachim Knobloch Universität Karlsruhe, European Institute for System Security, Am Fasanengarten 5, D-76128 Karlsruhe, Germany
Marcus Otten Universität Karlsruhe, European Institute for System Security, Am Fasanengarten 5, D-76128 Karlsruhe, Germany
Published in:
· Proceeding
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Pages 189-194
ACM New York, NY, USA ©1993
table of contents ISBN:0-89791-629-8 doi>10.1145/168588.168612
Verifiable secret sharing for monotone access structures Published by ACM 1993 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 15
· Downloads (cumulative): 606
· Citation Count: 3


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