Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xia-qin Fang

dblp:374/4810 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0000-2061-8762ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 50% Cryptographic primitives and cryptanalysis · 50%
Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key exchange
group key agreement
1.012026
Quantum Multiparty Key Agreement Protocols With Application to Privacy-Preserving Searchable Encryption · IEEE Trans. Computers 2026
Cryptographic primitives and cryptanalysis
searchable encryption
1.012026
Quantum Multiparty Key Agreement Protocols With Application to Privacy-Preserving Searchable Encryption · IEEE Trans. Computers 2026
Quantum computing and quantum information
quantum cryptography
0.312026
Quantum Multiparty Key Agreement Protocols With Application to Privacy-Preserving Searchable Encryption · IEEE Trans. Computers 2026

Methods — techniques the papers use, named apart from their topics

quantum key agreement · 2.0
YearPublicationVenuePosition
2026 Quantum Multiparty Key Agreement Protocols With Application to Privacy-Preserving Searchable Encryption
Xia-qin Fang
IEEE Trans. Computers2
2024 Quantum Scheme for Privacy-Preserving Range MAX/MIN Query in Edge-Based Internet of Things
abstract
Range query in cloud-based outsourcing applications is an important data search service, but it can suffer from privacy disclosure. In this paper, to enhance the security and privacy of sensitive data, we introduce quantum cryptographic technologies and present a feasible quantum approach to address an important range query, i.e., privacy-preserving range MAX/MIN query. First, we define a primitive protocol of secure multiparty computations, called Oblivious Set Inclusion Decision (OSID), in which two parties jointly decide whether a private set includes another private set in an oblivious way, and present an efficient OSID quantum protocol. Especially, in order to efficiently implement OSID quantum protocol, we design a single-photon-based quantum protocol for computing XOR of two private bits, which can achieve the information-theoretical security with the help of a non-colluding quantum cloud. Finally, we propose a novel quantum scheme for privacy-preserving range MAX/MIN query in edge-based Internet of Things by using OSID quantum protocols. Compared with the classical related schemes, our proposed quantum scheme has higher security (i.e., quantum security), because the security of our proposed protocols is based on the basic physical principles of quantum mechanics, instead of unproven computational difficulty assumptions.
Xia-qin Fang
IEEE Trans. Netw. Serv. Manag.2