RFRongquan Feng

Rongquan Feng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Rongquan Feng has a total of 70 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Existence and Nonexistence of Splitter Sets

    by Zhiyu Yuan, Rongquan Feng, Gennian Ge

    In this paper, the existence of perfect and quasi-perfect splitter sets in finite abelian groups is studied, motivated by their application in coding theory for flash memory storage. For perfect splitter sets we view them as splittings of $\mathbb{Z}_n$, and using cyclotomic polynomials we derive a general condition for the existence of such splittings under certain circumstances. We further establish a relation between $B[-k, k](q)$ and $B[-(k-1), k+1](q)$ splitter sets, and give a necessary and sufficient condition for the existence of perfect $B[-1, 5](q)$ splitter sets. Finally, two nonexistence results for quasi-perfect splitter sets are presented.

  • Open Access

    Linear hypermaps--modelling linear hypergraphs on surfaces

    by Kai Yuan, Qi Wang, Rongquan Feng, Yan Wang

    A hypergraph is linear if each pair of distinct vertices appears in at most one common edge. We say $\varGamma=(V,E)$ is an associated graph of a linear hypergraph $\mathcal{H}=(V, X)$ if for any $x\in X$, the induced subgraph $\varGamma[x]$ is a cycle, and for any $e\in E$, there exists a unique edge $y\in X$ such that $e\subseteq y$. A linear hypermap $\mathcal{M}$ is a $2$-cell embedding of a connected linear hypergraph $\mathcal{H}$'s associated graph $\varGamma$ on a compact connected surface, such that for any edge $x\in E(\mathcal{H})$, $\varGamma[x]$ is the boundary of a $2$-cell and for any $e\in E(\varGamma)$, $e$ is incident with two distinct $2$-cells. In this paper, we introduce linear hypermaps to model linear hypergraphs on surfaces and regular linear hypermaps modelling configurations on the surfaces. As an application, we classify regular linear hypermaps on the sphere and determine the total number of proper regular linear hypermaps of genus 2 to 101.

  • Privacy-Preserving Queries Using Multisource Private Data Counting on Real Numbers in IoT

    by Guanglai Guo, Yan Zhu, Cecilia E. Chen, Lejun Zhang, Rongquan Feng, Di Ma

    In this paper, our primary focus is on the current lack of privacy-preserving queries tailored to real-number fields rather than integers. We take multisource Private Data Counting on Real numbers (R-PDC) within IoT architecture as a breakthrough point to enable diverse query services without revealing sensitive data. The advantage of this is that the parameters required for queries remain stable and minimal in the scenario of wide numerical domain and dynamic changed dataset. At first, we present a general R-PDC method based on curve approximation, in which an Approximate Query Function (AQF) is established to approximate the constructed ideal counting curve for element queries on target set. We also demonstrate curve construction process of AQF and provide the feasibility theorem of AQF for counting a target element within an allowable error. By integrating the R-PDC method with fixed-point fully homomorphic encryption, an efficient R-PDC scheme is presented to perform multiparty collaborative queries in IoT. In security aspect, the R-PDC scheme on (m,)-AQF is proved to be statistically secure against Chosen Element Attack (CEA) for cumulative error and dataset size m. Moreover, the scheme achieves O(nmγ) computation and O(n2mγ) communication complexities for n servers and γ-length fraction. Finally, as an extension of AQF over single attribute, multi-dimensional R-PDC method is applied into privacy-preserving Naive Bayes Classifier and Apriori algorithm over multiple attributes. Our work provides substantial support and insights for the advancement of privacy computation.


  • Open Access

    On Linear Perfect b-Symbol Codes over Finite Fields

    by Kanat Abdukhalikov, Jiajie Chen, Rongquan Feng

    Motivated by the application of high-density data storage technologies, Cassuto and Blaum introduced codes for symbol-pair read channels in 2011, and Yaakobi et al. generalized the coding framework to that for b-symbol read channels where b≥2 in 2016. In this paper, we establish a b-sphere-packing bound and present a recurrence relationship for the b-weight enumerator. We determine all parameters of linear perfect b-symbol e-error-correcting codes over Fq for e<2b and show that for 2b≤e<3b, there exist at most finite such codes for a given b, e, and q. We construct a family of linear perfect b-symbol b-error-correcting codes over Fq using constacyclic codes.

  • Open Access

    Counting rational points of quartic diagonal hypersurfaces over finite fields

    by Shuangnian Hu, Yanyan Li, Rongquan Feng

    Let $ \mathbb{F}_q $ be the finite field of order $ q $ where $ q = p^{k} $, $ k $ is a positive integer and $ p $ is an odd prime. Let $ \mathbb{F}_q^* $ represent the nonzero elements of $ \mathbb{F}_{q} $. For $ f(x_1, \cdots, x_n)\in\mathbb{F}_q[x_1, \cdots, x_n] $, we used $ N\big(f(x_1, \cdots, x_n) = 0\big) $ to denote the number of $ \mathbb{F}_q $-rational points of the affine hypersurface $ f(x_1, \cdots, x_n) = 0 $. In 2020, Zhao et al. obtained the explicit formulae for $ N(x_1^4+x_2^4 = c) $, $ N(x_1^4+x_2^4+x_3^4 = c) $ and $ N(x_1^4+x_2^4+x_3^4+x_4^4 = c) $ over $ \mathbb{F}_q $, with $ c\in\mathbb{F}_q^* $. In this paper, by using Jacobi sums and an analog of the Hasse-Davenport theorem, we arrived at explicit formulae for $ N(a_1x_1^4+a_2x_2^4 = c) $ and $ N(b_1x_1^4+b_2x_2^4+b_3x_3^4 = c) $ with $ a_i, b_j\in \mathbb{F}_q^* (1\leq i \leq 2, 1 \leq j \leq 3) $ and $ c\in \mathbb{F}_q $. Furthermore, by using the reduction formula for Jacobi sums, the number of rational points of the quartic diagonal hypersurface $ a_1x_1^4+a_2x_2^4+\cdots+a_nx_n^4 = c $ of $ n\geq 4 $ variables with $ a_i\in\mathbb{F}_q^* $ $ (1\leq i\leq n) $, $ c\in\mathbb{F}_q $ and $ p\equiv1({\rm{mod}} \ 4) $, can also be deduced. These extended and improved earlier results.

  • Open Access

    The number of solutions of cubic diagonal equations over finite fields

    by Shuangnian Hu, Rongquan Feng

    Let $ p $ be a prime, $ k $ be a positive integer, $ q = p^k $, and $ \mathbb{F}_q $ be the finite field with $ q $ elements. Let $ \mathbb{F}_q^* $ be the multiplicative group of $ \mathbb{F}_{q} $, that is $ \mathbb{F}_q^* = \mathbb{F}_{q}\setminus\{0\} $. In this paper, explicit formulae for the numbers of solutions of cubic diagonal equations $ a_1x_1^3+a_2x_2^3 = c $ and $ b_1x_1^3+b_2x_2^3+b_3x_3^3 = c $ over $ \mathbb{F}_q $ are given, with $ a_i, b_j\in\mathbb{F}_q^* $ $ (1\leq i\leq 2, 1\leq j\leq 3) $, $ c\in\mathbb{F}_q $ and $ p\equiv1(\rm{mod} \ 3) $. Furthermore, by using the reduction formula for Jacobi sums, the number of solutions of the cubic diagonal equations $ a_1x_1^3+a_2x_2^3+\cdots+a_sx_s^3 = c $ of $ s\geq 4 $ variables with $ a_i\in\mathbb{F}_q^* $ $ (1\leq i\leq s) $, $ c\in\mathbb{F}_q $ and $ p\equiv1(\rm{mod} \ 3) $, can also be deduced.


  • Open Access

    An Efficient Zero-Knowledge Dual Membership Proof Supporting Pos-and-Neg Membership Decision

    by Hongjian Yin, E Chen, Yan Zhu, Rongquan Feng, Stephen S. Yau

    In this paper, we address the problem of secure decision of membership. We present a Zero-Knowledge Dual Membership Proof (ZKDMP) protocol, which can support positive and negative (Pos-and-Neg) membership decisions simultaneously. To do it, two secure aggregation functions are used to compact an arbitrarily-sized subset into an element in a cryptographic space. By using these aggregation functions, a subset can achieve a secure representation, and the representation size of the subsets is reduced to the theoretical lower limit. Moreover, the zeros-based and poles-based secure representation of the subset are used to decide Pos-and-Neg membership, respectively. We further verify the feasibility of combining these two secure representations of the subset, so this result is used to construct our dual membership decision cryptosystem. Specifically, our ZKDMP protocol is proposed for dual membership decisions, which can realize a cryptographic proof of strict Pos-and-Neg membership simultaneously. Furthermore, the zero-knowledge property of our construction ensures that the information of the tested element will not be leaked during the implementation of the protocol. In addition, we provide detailed security proof of our ZKDMP protocol, including positive completeness, negative completeness, soundness and zero-knowledge.