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

Qingshui Xue

dblp:93/4048 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
1since 2021 · last 2024
—ORCID · none

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

Computer networks · 4 · 1 since 2021Systems, architecture and hardware · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2Security and privacy · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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 primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.012004
A new threshold proxy signature scheme from bilinear pairings · Sci. China Ser. F Inf. Sci. 2004
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
proxy signature
0.012004
A new threshold proxy signature scheme from bilinear pairings · Sci. China Ser. F Inf. Sci. 2004
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › proxy signature
threshold proxy signature
0.012004
A new threshold proxy signature scheme from bilinear pairings · Sci. China Ser. F Inf. Sci. 2004

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

bilinear pairing · 0.0
YearPublicationVenuePosition
2024 Locally verifiable approximate multi-member quantum threshold aggregation digital signature scheme
Qingshui Xue, Jiewei Cai, Yixun He, Yinhang Li
Comput. Commun.2
2019 An RBF neural network-based dynamic virtual network embedding algorithm
abstract
Summary Network virtualization is a promising technology, which is used to solve the existing shortcomings of the Internet architecture and in which virtual network (VN) embedding plays a vital role in resource allocation. However, current virtual network embedding algorithms mainly deal with static VN embedding; the allocations of network resources are constant and excessive in the VN requests' lifetime. In reality, the user's resource requirements usually change with time; hence, static VN embedding algorithms can lead to low utilization of substrate resources and reduction of the operators' revenues. To solve the aforementioned problem, we focus on the virtual network embedding considering dynamic demands in this paper. We apply supervised radial basis function (RBF) neural network to predict the changes of virtual requests and dynamically reallocate substrate resources by adjusting already allocated resources. Simulation experiments show that compared with the static algorithms, dynamic VN embedding schemes with supervised RBF can more accurately predict the demand changes of virtual networks, which adaptively adjusts resources allocation and management and therefore improves resource utilization of substrate networks.
Xiangwei Zheng 0001, Qingshui Xue
Concurr. Comput. Pract. Exp.4
2017 Security Modeling and Analysis on Intra Vehicular Network
abstract
Controller Area Network (CAN), the de facto standard in-vehicle network protocol, prompts modern automobile an integrated system that achieves real-time interactions with roads, vehicles and people. Yet such connectivity makes it feasible to illegally access, or even attack the CAN, causing not only privacy disclosure, property damage, but also life threat. In this paper, we analyze intrinsic weakness in CAN protocol that is mostly exploited by attackers and comprehensively survey the existing attacks based on CAN interfaces. Furthermore, we propose an attack evaluation system based on attack tree model and Markov chain to assess the probability of compromising CAN and the steady state of CAN system at the presence of these attacks. Finally, we simulate new steady state when altering the difficulty of a certain attack and the results demonstrate that sometimes improving defense of an attack declines the security level of the entire system instead.
Jinli Zhong, Suguo Du, Haojin Zhu, Cailian Chen, Qingshui Xue
VTC Fall7
2017 Detect SIP Flooding Attacks in VoLTE by Utilizing and Compressing Counting Bloom Filter
Na Ruan, Shiheng Ma, Haojin Zhu, Weijia Jia 0001, Qingshui Xue
WASA6
2016 A Traffic Based Lightweight Attack Detection Scheme for VoLTE
abstract
With rapid growth of LTE network and Voice-over-LTE(VoLTE), detecting and preventing security threats like Denial of Service attack becomes a necessary and urgent requirement. VoLTE is an voice solution based on Internet Protocol and 4G LTE technology, at the same time exposing many vulnerabilities when using packet-switched network. There are many heavy weighted detection systems using content analysis, while high demands of computing resource constraint their practical use. In this paper, we purpose a lightweight detection scheme for VoLTE network security, based on analysis of data traffic flow. To optimize parameters in our scheme, we formulate a Bayesian game model. Bayesian game has the features of incomplete information and asymmetry, similar to practical attack-defense model. Besides, The dynamic Bayesian game is more realistic, since both sides can update believes about their opponents. Simulation results provide some guidances on parameter selection, as well as verifying the superiority of our scheme.
Na Ruan, Haojin Zhu, Qingshui Xue, Weijia Jia 0001, Jingyu Cui
GLOBECOM5
2016 Multi-proxy multi-signature binding positioning protocol
abstract
For the first time, one new conception, multi-proxy multi-signature binding positioning protocol, is proposed. Based on the secure positioning protocol, one model of multi-proxy multi-signature binding positioning protocol is proposed. In the model, positioning protocol is bound to multi-proxy multi-signature tightly, not loosely. Further, we propose one scheme of multi-proxy multi-signature binding positioning protocol, its correctness is proved, and its security is analyzed. Copyright © 2016 John Wiley & Sons, Ltd.
Qingshui Xue, Zhenfu Cao
Secur. Commun. Networks1
2015 Multi-proxy Multi-signature Binding Positioning Protocol
Qingshui Xue, Zhenfu Cao, Jianwen Hou
WASA2
2010 Some basic principles for proxy signature schemes based on ECDLP
abstract
Nowadays, most proxy signature schemes are based on the difficulty of DLP (Discrete Logarithm Problem) or ECDLP (Elliptical Curve Discrete Logarithm Problem). As though many proxy signature schemes based on DLP or ECDLP have been proposed, it makes us discouraged that some disadvantages can be found
Qingshui Xue, Zhenfu Cao
CollaborateCom2
2008 A Model of Bilinear-Pairings Based Designated-Verifier Proxy Signatue Scheme
Qingshui Xue, Jiping Zhang 0001, Zhenfu Cao
CollaborateCom2
2004 A Threshold Proxy Signature Scheme Using Self-Certified Public Keys
Qingshui Xue, Zhenfu Cao
ISPA1
2004 A Generalized Proxy Signature Scheme Based on the RSA Cryptosystem
Qingshui Xue, Zhenfu Cao, Haifeng Qian
PDCAT1
2004 A new threshold proxy signature scheme from bilinear pairings
Haifeng Qian, Zhenfu Cao, Qingshui Xue
Sci. China Ser. F Inf. Sci.3