Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
A combinatorial approach to threshold schemes
SIAM Journal on Discrete Mathematics
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Generalized secret sharing and monotone functions
CRYPTO '88 Proceedings on Advances in cryptology
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Nonperfect secret sharing schemes and matroids
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Hi-index | 0.00 |
Threshold schemes allow any t out of l individuals to recompute a secret (key). General sharing schemes are a generalization. In homomorphic sharing schemes the "product" of shares of the keys gives a share of the product of the keys. We prove that there exist infinitely many Abelian groups over which there does not exist an ideal homomorphic threshold scheme. Additionally we classify ideal homomorphic general sharing schemes. We discuss the potential impact of our result on the construction of general sharing schemes.