STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Is the data encryption standard a group? (Results of cycling experiments on DES)
Journal of Cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Cryptosystem for group oriented cryptography
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Communications of the ACM
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Generalized Threshold Cryptosystems
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Requirements for Group Independent Linear Threshold Secret Sharing Schemes
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Efficient multiplicative sharing schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Classification of ideal homomorphic threshold schemes over finite Abelian groups
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
| Hi-index | 0.00 |
Homomorphic threshold schemes were introduced by Benaloh and have found several applications. In this paper we prove that there do not exist perfect finite homomorphic general monotone sharing schemes for which the key space is a finite non-Abelian group (except for very particular access structures). This result is valid for the most general case, e.g., if each participant receives shares from different sets and when these sets are not necessarily groups.We extend the definition of homomorphic threshold scheme to allow that the homomorphic property is valid for two-operations when the set of keys is a finite Boolean Algebra or a Galois field then there does not exist a perfect finite two-operation-homomorphio general sharing scheme.