Classification of ideal homomorphic threshold schemes over finite abelian groups

10Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Frankel, Y., & Desmedt, Y. (1993). Classification of ideal homomorphic threshold schemes over finite abelian groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 25–34). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free