Welcome to the resource topic for 2006/001
Homomorphic Cryptosystems and their Applications
Authors: Doerte K. RappeAbstract:
In this thesis we consider homomorphic cryptosystems and their applications. Homomorphic cryptosystems allow for computations on encrypted data. We prove that the search for an algebraically homomorphic scheme can be reduced to the search of a homomorphic scheme on a special non-abelian group. Furthermore, we focus on a special application: computing with encrypted functions and data, respectively. For this application we develop an improved protocol that is efficient for functions that are computable by polynomial branching programs. Finally, we generalise the elliptic curve Paillier scheme by S. Galbraith in order to construct a threshold version of it. For this threshold scheme we develop several Sigma-protocols. Using these protocols we apply our threshold scheme on multiparty computations, electronic voting and commitment schemes.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .