2 citations · 3 across the 14 of their papers we have counts for
6 papers · 1 filter
Linearly Homomorphic Ring Signature Scheme over Lattices
Heng Guo, Jia Li, Yanan Wang +3
Construct the first provably secure linear homomorphic ring signature scheme. Ring signatures allow a signer to anonymously sign a message on behalf of a user group (ring) and are…
Authenticated Private Set Intersection: A Merkle Tree-Based Approach for Enhancing Data Integrity
Zixian Gong, Zhiyong Zheng, Zhe Hu +4
Private Set Intersection (PSI) enables secure computation of set intersections while preserving participant privacy, standard PSI existing protocols remain vulnerable to data integ…
Semigroup-homomorphic Signature
Heng Guo, Kun Tian, Fengxia Liu +1
In 2002, Johnson et al. posed an open problem at the Cryptographers' Track of the RSA Conference: how to construct a secure homomorphic signature on a semigroup, rather than on a g…
Linearly Homomorphic Signature with Tight Security on Lattice
Heng Guo, Fengxia Liu, Kun Tian +1
Constructing cryptographic schemes with tight or almost-tight security has long been one of the central problems in theoretical cryptography. At ASIACRYPT 2016, Boyen and Li posed…
On the MacWilliams Theorem over Codes and Lattices
Zhiyong Zheng, Fengxia Liu, Kun Tian
Analogies between codes and lattices have been extensively studied for the last decades, in this dictionary, the MacWilliams identity is the finite analog of the Jacobi-Poisson for…
An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem
Zhiyong Zheng, Fengxia Liu, Kun Tian
We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the dat…