Rongquan Feng

According to our database1, Rongquan Feng authored at least 73 papers between 1998 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
On the least eigenvalue of genuine strongly 3-walk-regular graphs.
Appl. Math. Comput., 2025

2024
Quadratic bent functions and their duals.
Appl. Algebra Eng. Commun. Comput., July, 2024

Privacy-Preserving Queries Using Multisource Private Data Counting on Real Numbers in IoT.
IEEE Internet Things J., April, 2024

Efficient Key Generation on Lattice Cryptography for Privacy Protection in Mobile IoT Crowdsourcing.
IEEE Internet Things J., January, 2024

2023
Efficient Multiparty Fully Homomorphic Encryption With Computation Fairness and Error Detection in Privacy Preserving Multisource Data Mining.
IEEE Trans. Reliab., December, 2023

Obituary of Professor Zhexian Wan.
Des. Codes Cryptogr., September, 2023

2022
Attribute-Based Private Data Sharing With Script-Driven Programmable Ciphertext and Decentralized Key Management in Blockchain Internet of Things.
IEEE Internet Things J., 2022

Two classes of power mappings with boomerang uniformity 2.
Adv. Math. Commun., 2022

2021
A Note on Spectral Radius and Maximum Degree of Irregular Graphs.
Graphs Comb., 2021

How to implement secure cloud file sharing using optimized attribute-based access control with small policy matrix and minimized cumulative errors.
Comput. Secur., 2021

Directed strongly regular Cayley graphs on dihedral groups.
Appl. Math. Comput., 2021

2020
The Edge-Connectivity of Strongly 3-Walk-Regular Graphs.
Graphs Comb., 2020

On hamilton decompositions of Cayley graphs on dihedral groups.
Appl. Math. Comput., 2020

2019
Two-weight and three-weight linear codes based on Weil sums.
Finite Fields Their Appl., 2019

New instant confirmation mechanism based on interactive incontestable signature in consortium blockchain.
Frontiers Comput. Sci., 2019

On arc-transitive pentavalent graphs of order 2<sup><i>m</i></sup><i>p<sup>n</sup></i>.
Appl. Math. Comput., 2019

FlashGhost: Data Sanitization with Privacy Protection Based on Frequent Colliding Hash Table.
Proceedings of the 2019 IEEE International Conference on Services Computing, 2019

2018
A new family of Geodesic transitive graphs.
Discret. Math., 2018

Verifiable random functions with Boolean function constraints.
Sci. China Inf. Sci., 2018

2017
Cheating prevention visual cryptography scheme using Latin square.
IET Inf. Secur., 2017

Generalized Hamming weights of three classes of linear codes.
Finite Fields Their Appl., 2017

Perfect codes in circulant graphs.
Discret. Math., 2017

Explicit factorizations of cyclotomic polynomials over finite fields.
Des. Codes Cryptogr., 2017

Nonexistence of generalized bent functions from ℤ<sub>2</sub><sup>n</sup> to ℤ<sub>m</sub>.
Des. Codes Cryptogr., 2017

2016
Constructions of -designs from orthogonal geometry over finite fields.
Discret. Math., 2016

A class of three-weight linear codes.
CoRR, 2016

2015
On the Solvability of 3s/nt Sum-Network - A Region Decomposition and Weak Decentralized Code Method.
CoRR, 2015

Nonexistence of Generalized Bent Functions From $Z_{2}^{n}$ to $Z_{m}$.
CoRR, 2015

A New Construction of Tagged Visual Cryptography Scheme.
Proceedings of the Digital-Forensics and Watermarking - 14th International Workshop, 2015

2014
Finding normal bases over finite fields with prescribed trace self-orthogonal relations.
Finite Fields Their Appl., 2014

Network Coding for $3$s$/n$t Sum-Networks.
CoRR, 2014

Lattice-based key exchange on small integer solution problem.
Sci. China Inf. Sci., 2014

2013
The Complexity of Network Coding With Two Unit-Rate Multicast Sessions.
IEEE Trans. Inf. Theory, 2013

Twisted Jacobi intersections curves.
Theor. Comput. Sci., 2013

On the solvability of single rate 2-pair networks - A cut-based characterization.
Phys. Commun., 2013

Unit time-phase signal sets: Bounds and constructions.
Cryptogr. Commun., 2013

Efficient Identity-Based Encryption without Pairings and Key Escrow for Mobile Devices.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2013

Efficient Self-pairing on Ordinary Elliptic Curves.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
Error Correction for Cooperative Data Exchange.
IEEE Commun. Lett., 2012

Adaptive Key Protection in Complex Cryptosystems with Attributes.
IACR Cryptol. ePrint Arch., 2012

A method of evaluation of exponential sum of binary quadratic functions.
Finite Fields Their Appl., 2012

On the existence of some specific elements in finite fields of characteristic 2.
Finite Fields Their Appl., 2012

Isomorphism Classes of Jacobi Quartic Curve over Finite Fields.
Proceedings of the Information Technology Convergence, Secure and Trust Computing, and Data Management, 2012

Network coding for two-unicast with rate (1, 2).
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

A New Model of Binary Elliptic Curves.
Proceedings of the Progress in Cryptology, 2012

The encoding complexity of network coding with two simple multicast sessions.
Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

2011
Proof of a conjecture about rotation symmetric functions.
Discret. Math., 2011

Regular t-balanced Cayley maps for abelian groups.
Discret. Math., 2011

Bounds on and Constructions of Unit Time-Phase Signal Sets
CoRR, 2011

2010
Attribute-Based Signature with Policy-and-Endorsement Mechanism.
J. Comput. Sci. Technol., 2010

A New Model of Binary Elliptic Curves with Fast Arithmetic.
IACR Cryptol. ePrint Arch., 2010

Elliptic curves in Huff 's model.
IACR Cryptol. ePrint Arch., 2010

Number of Jacobi quartic curves over finite fields.
IACR Cryptol. ePrint Arch., 2010

On the Construction of Finite Oscillator Dictionary
CoRR, 2010

A Generalized Construction of OFDM M-QAM Sequences With Low Peak-to-Average Power Ratio
CoRR, 2010

Encoding Complexity for Intersession Network Coding with Two Simple Multicast Sessions
CoRR, 2010

On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization
CoRR, 2010

2009
A mean value formula for elliptic curves.
IACR Cryptol. ePrint Arch., 2009

Enumerating typical abelian prime-fold coverings of a circulant graph.
Discret. Math., 2009

A generalized construction of OFDM <i>M</i>-QAM sequences with low peak-to-average power ratio.
Adv. Math. Commun., 2009

2008
Authentication codes and bipartite graphs.
Eur. J. Comb., 2008

Preface.
Eur. J. Comb., 2008

Eigenvalues of association schemes of quadratic forms.
Discret. Math., 2008

2007
Erratum: Enumerating Typical Circulant Covering Projections onto a Circulant Graph.
SIAM J. Discret. Math., 2007

Cross-Correlation Properties of Cyclotomic Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Efficient Pairing Computation on Curves.
IACR Cryptol. ePrint Arch., 2007

On the ranks of bent functions.
Finite Fields Their Appl., 2007

Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
A classification of regular <i>t</i>-balanced Cayley maps on dihedral groups.
Eur. J. Comb., 2006

2005
Enumerating Typical Circulant Covering Projections Onto a Circulant Graph.
SIAM J. Discret. Math., 2005

Circulant Double Coverings of a Circulant Graph of Valency Four.
Graphs Comb., 2005

2004
Typical circulant double coverings of a circulant graph.
Discret. Math., 2004

1998
Isomorphism Classes of Concrete Graph Coverings.
SIAM J. Discret. Math., 1998


  Loading...