Renzhang Liu

most citedImproved Key Generation Algorithm for Gentry's Fully Homomorphic Encryption Scheme

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2026

A Complete Proof for Tu-Deng Conjecture

Renzhang Liu, Hengyi Luo, Tianyuan Xie

Let $N = 2^{k} - 1$ and let $wt (n)$ denote the binary Hamming weight. The Tu-Deng conjecture asserts that, for every $1 \leq t \leq N - 1$ , at most $2^{k - 1}$ pairs $(a,b)\in\{0,…

cs.CR2017★ 2 cited

Improved Key Generation Algorithm for Gentry's Fully Homomorphic Encryption Scheme

Yang Zhang, Renzhang Liu, Dongdai Lin

At EUROCRYPT 2011, Gentry and Halevi implemented a variant of Gentry's fully homomorphic encryption scheme. The core part in their key generation is to generate an odd-determinant…