Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group

摘要: A threshold scheme is an algorithm in which a distributor creates $l$ shares of secret such that fixed minimum number ($t$) are needed to regenerate the secret. perfect does not reveal anything new from information theoretical viewpoint $t-1$ shareholders {about secret}. When entropy zero all sharing schemes perfect, so loses its intuitive meaning. The concept {zero-knowledge scheme} introduced prove anything, even computational viewpoint. New homomorphic over any finite Abelian group for operation and inverses computable polynomial time developed. One also satisfies zero-knowledge property. generalization toward general discussed it proven ideal do always exist.