Existence of multiplicative secret sharing schemes with polynomial share expansion

Authors:
Giovanni di Crescenzo;Yair Frankel
Affiliations:
Computer Science Department, University of California at San Diego, La Jolla, CA;CertCo, 55 Broad Street, New York, NY
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Generalized secret sharing and monotone functions

CRYPTO '88 Proceedings on Advances in cryptology
How to share a function securely

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Symmetric logspace is closed under complement

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
How to share a secret

Communications of the ACM
Multiplicative Non-abelian Sharing Schemes and their Application to Threshold Cryptography

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Efficient multiplicative sharing schemes

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

Hi-index	0.00