Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio

Authors:
Giovanni Di Crescenzo
Affiliations:
Telcordia Technologies, Inc., Morristown, NJ and Computer Science Department, University of California San Diego, La Jolla, CA
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Generalized secret sharing and monotone functions

CRYPTO '88 Proceedings on Advances in cryptology
An explication of secret sharing schemes

Designs, Codes and Cryptography
Multisecret threshold schemes

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the information rate of perfect secret sharing schemes

Designs, Codes and Cryptography
How to share a secret

Communications of the ACM
Multi-Secret Sharing Schemes

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology

Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Sharing one secret vs. sharing many secrets

Theoretical Computer Science - Mathematical foundations of computer science
An improved multi-stage (t, n)-threshold secret sharing scheme

WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management

Hi-index	0.00