2 citations · 3 across the 14 of their papers we have counts for
14 papers
Quantum Multi-Party Threshold Private Set Intersection with Explicit Cardinality Testing
Zixian Gong, Kun Tian, Yi Zhang +1
Threshold private set intersection (TPSI) allows parties to reveal their intersection only when its cardinality reaches a prescribed threshold. Existing quantum TPSI protocols typi…
Verifiable and Collusion-Resistant Multi-Party Quantum Private Set Operations
Zixian Gong, Kun Tian, Yi Zhang +1
Threshold private set intersection (TPSI) allows parties to reveal their intersection only when its cardinality reaches a prescribed threshold. Existing quantum TPSI protocols typi…
Efficient Quantum Fully Homomorphic Encryption
Fengxia Liu, Zixian Gong, Kun Tian +3
Quantum fully homomorphic encryption (QFHE) enables arbitrary quantum computations on encrypted data, but prior constructions require prohibitive quantum resources--specifically, O…
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…
MacWilliams Theory over Zk and nu-functions over Lattices
Zhiyong Zheng, Fengxia Liu, Kun Tian
Continuing previous works on MacWilliams theory over codes and lattices, a generalization of the MacWilliams theory over for codes is established, and the comple…
Codes over Finite Ring , MacWilliams Identity and Theta Function
Zhiyong Zheng, Fengxia Liu, Kun Tian
In this paper, we study linear codes over based on lattices and theta functions. We obtain the complete weight enumerators MacWilliams identity and the symmetrized w…
Authenticated Sublinear Quantum Private Information Retrieval
Fengxia Liu, Zhiyong Zheng, Kun Tian +5
This paper introduces a novel lower bound on communication complexity using quantum relative entropy and mutual information, refining previous classical entropy-based results. By l…
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…
A Generalization of Cyclic Code and Applications to Public Key Cryptosystems
Zhiyong Zheng, Wenlin Huang, Jie Xu +1
In this paper, we define and discuss ϕ-cyclic code, which may be regarded as a general form of the ordinary cyclic code. As applications, we explain how to extend two public key en…
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
Zhiyong Zheng, Fengxia Liu, Yunfan Lu +1
Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajtai's constr…