National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 

Warning: Requested record does not seem to exist.
Effectivity and Limitations of Homomorphic Secret Sharing Schemes
Jančová, Ľubica ; Hubáček, Pavel (advisor) ; Holub, Štěpán (referee)
This thesis focuses on constructions of Homomorphic Secret Sharing (HSS) based on assumptions not known to imply fully homomorphic encryption. The efficiency of these constructions depends on the complexity of the Distributed Discrete Logarithm (DDLog) problem in the corresponding groups. We describe this problem in detail, focusing on the possibility of leveraging preprocessing in prime order groups, and deriving upper bounds on the success probability for the DDLog problem with preprocessing in the generic group model. Further, we present a new HSS construction. We base our construction on the Joye-Libert encryption scheme which we adapt to support an efficient distributed discrete logarithm protocol. Our modified Joye-Libert scheme requires a new set of security assumptions, which we introduce, proving the IND-CPA security of our scheme given these assumptions. 1

Interested in being notified about new results for this query?
Subscribe to the RSS feed.