Qingsong Yao
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
Research Subjects
Qingsong Yao has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Xuewen Dong
School of Computer Science & Technology, Xidian University, Xi’an 710071, China
6 shared publications Yong Qi
5 shared publications- Jianfeng Ma
Xidian University
4 shared publications Jinsong Han
4 shared publications- Yulong Shen
Xidian University
4 shared publications - Cong Sun
School of Cyber Engineering, Xidian University, Xian, China
2 shared publications
Latest Publications
- Open Access
- 27 May 2026
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 32 (2) , 1027-1046
SeCA: Software Behavior-Enforced Collective Attestation for Highly Dynamic Device Networks
The Internet of Things and collaborative embedded device networks, such as vehicular networks, robots, and unmanned aerial vehicle swarms, are increasingly used in the real world. Such devices confront severe physical attacks and software compromises beyond the network threats. Collective attestation is a popular approach for verifying the security and integrity of remote devices. However, existing collective attestation approaches mitigating physical attacks focus only on attesting the devices’ static code integrity. They cannot resist the runtime compromises that hijack the control flow of the task programs. We propose SeCA, an efficient collective attestation framework that uses the trusted execution environment based self-attestation to withstand the runtime control-flow hijacking on the task programs of the networked devices. SeCA’s collective attestation protocol achieves efficient attestation evidence aggregation and uses a heartbeat mechanism to mitigate the physical attacks in highly dynamic networks. We implement SeCA on the Raspberry Pi 3b board. Compared to the state-of-the-art control-flow attestation approach, SeCA’s program instrumentation reduces the code size and runtime attestation overhead. Additionally, SeCA’s attestation report aggregation scheme reduces the per-device computational, storage, and communication overhead. Overall, SeCA is the first collective attestation that can resist both physical attacks and runtime control-flow hijacking, with competitive attestation performance compared to other collective attestation methods.
- 27 May 2026
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 32 (2) , 1027-1046
Open AccessSeCA: Software Behavior-Enforced Collective Attestation for Highly Dynamic Device Networks
The Internet of Things and collaborative embedded device networks, such as vehicular networks, robots, and unmanned aerial vehicle swarms, are increasingly used in the real world. Such devices confront severe physical attacks and software compromises beyond the network threats. Collective attestation is a popular approach for verifying the security and integrity of remote devices. However, existing collective attestation approaches mitigating physical attacks focus only on attesting the devices’ static code integrity. They cannot resist the runtime compromises that hijack the control flow of the task programs. We propose SeCA, an efficient collective attestation framework that uses the trusted execution environment based self-attestation to withstand the runtime control-flow hijacking on the task programs of the networked devices. SeCA’s collective attestation protocol achieves efficient attestation evidence aggregation and uses a heartbeat mechanism to mitigate the physical attacks in highly dynamic networks. We implement SeCA on the Raspberry Pi 3b board. Compared to the state-of-the-art control-flow attestation approach, SeCA’s program instrumentation reduces the code size and runtime attestation overhead. Additionally, SeCA’s attestation report aggregation scheme reduces the per-device computational, storage, and communication overhead. Overall, SeCA is the first collective attestation that can resist both physical attacks and runtime control-flow hijacking, with competitive attestation performance compared to other collective attestation methods.
- 3 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (1) , 491-503
MHCertChain: A Multi-CA Hierarchical Certificate Blockchain With Low Overhead
Blockchain-based certificate management schemes provide a distributed approach for Public Key Infrastructure through the integration of blockchain services, thereby enhancing transparency and security in identity authentication. However, existing schemes often suffer from limited scalability when accommodating new CAs, high overhead of blockchain systems, and a high false-positive rate in revocation status checks. To address above issues, we propose MHCertChain, a multi-CA hierarchical certificate blockchain with low overhead. Specifically, a two-layer blockchain structure including the main chain and sub-chains is designed to enhance scalability, while the main chain stores trust paths between CAs and each automatically deployed sub-chain records user certificates issued by an end-entity CA. Then, we propose a lightweight dual-signature certificate format that contains certificate location information without requiring any external certificate location method outside the blockchain. Considering time characteristics of certificates, a time-partitioned cuckoo filter is proposed with a low false positive rate and accelerates revocation status query. Moreover, we deduce an optimal global performance parameter of such filter through mathematical modeling. We present a thorough security analysis of our MHCertChain utilizing the universally composable framework, and extensive experiments demonstrate that the CPU overhead and false positive rate are reduced by 70% and 95%, respectively, compared to state-of-the-art schemes. Blockchain-based certificate management schemes provide a distributed approach for Public Key Infrastructure through the integration of blockchain services, thereby enhancing transparency and security in identity authentication. However, existing schemes seldom discuss hierarchical CA architecture, and often suffer from limited scalability and high overhead when considering new CAs, frequent certificate authentication and revocation status verification. To address above issues, we propose MHCertChain, a multi-CA hierarchical certificate blockchain with low overhead. Specifically, a two-layer blockchain structure including the main chain and sub-chains is designed, while the main chain stores trust paths between CAs and each automatically deployed sub-chain records user certificates issued by an end-entity CA. Then, we propose a lightweight dual-signature certificate format that contains certificate location information without requiring any external certificate location method outside the blockchain. Considering time characteristics of certificates, a time-partitioned cuckoo filter is proposed with a low false positive rate and accelerates revocation status query. Moreover, we deduce an optimal global performance parameter of such filter through mathematical modeling. We present a thorough security analysis of our MHCertChain utilizing the universally composable framework, and extensive experiments demonstrate that the CPU overhead and false positive rate are reduced by 70% and 95%, respectively, compared to state-of-the-art schemes. Blockchain-based certificate management schemes provide a distributed means to increase the transparency of PKI (Public Key Infrastructure) and prevent single point attacks in web communications. However, certificate management based on hierarchical multi-CA architecture often faces the problems of poor scalability and high CPU overhead in blockchain. In this article, we are the first to propose a multi-CA hierarchical certificate blockchain with low overhead. Specifically, a two-layer blockchain structure of the main chain and sub-chain is adopted, with the main chain storing the trust paths and the sub-chain storing the user certificates. By monitoring to the CA transactions of the main chain, the sub-chain is automatically deployed. Then, in the certificate operation, we consider the high CPU overhead of traditional certificate query in blockchain and propose a dual-signature certificate format. combined with the time characteristics of the certificate, a time-partitioned cuckoo filter is proposed with a low false positive rate for the revocation status query speeding, and we find a global performance optimal parameter through mathematical modeling. Finally, we use a general composable framework to prove the security of HiCertChain, and the experiments show that the CPU overhead and false positive rate are reduced by 90% and 95%, respectively, compared with those of state-of-the-arts.
- 3 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (1) , 491-503
MHCertChain: A Multi-CA Hierarchical Certificate Blockchain With Low Overhead
Blockchain-based certificate management schemes provide a distributed approach for Public Key Infrastructure through the integration of blockchain services, thereby enhancing transparency and security in identity authentication. However, existing schemes often suffer from limited scalability when accommodating new CAs, high overhead of blockchain systems, and a high false-positive rate in revocation status checks. To address above issues, we propose MHCertChain, a multi-CA hierarchical certificate blockchain with low overhead. Specifically, a two-layer blockchain structure including the main chain and sub-chains is designed to enhance scalability, while the main chain stores trust paths between CAs and each automatically deployed sub-chain records user certificates issued by an end-entity CA. Then, we propose a lightweight dual-signature certificate format that contains certificate location information without requiring any external certificate location method outside the blockchain. Considering time characteristics of certificates, a time-partitioned cuckoo filter is proposed with a low false positive rate and accelerates revocation status query. Moreover, we deduce an optimal global performance parameter of such filter through mathematical modeling. We present a thorough security analysis of our MHCertChain utilizing the universally composable framework, and extensive experiments demonstrate that the CPU overhead and false positive rate are reduced by 70% and 95%, respectively, compared to state-of-the-art schemes. Blockchain-based certificate management schemes provide a distributed approach for Public Key Infrastructure through the integration of blockchain services, thereby enhancing transparency and security in identity authentication. However, existing schemes seldom discuss hierarchical CA architecture, and often suffer from limited scalability and high overhead when considering new CAs, frequent certificate authentication and revocation status verification. To address above issues, we propose MHCertChain, a multi-CA hierarchical certificate blockchain with low overhead. Specifically, a two-layer blockchain structure including the main chain and sub-chains is designed, while the main chain stores trust paths between CAs and each automatically deployed sub-chain records user certificates issued by an end-entity CA. Then, we propose a lightweight dual-signature certificate format that contains certificate location information without requiring any external certificate location method outside the blockchain. Considering time characteristics of certificates, a time-partitioned cuckoo filter is proposed with a low false positive rate and accelerates revocation status query. Moreover, we deduce an optimal global performance parameter of such filter through mathematical modeling. We present a thorough security analysis of our MHCertChain utilizing the universally composable framework, and extensive experiments demonstrate that the CPU overhead and false positive rate are reduced by 70% and 95%, respectively, compared to state-of-the-art schemes. Blockchain-based certificate management schemes provide a distributed means to increase the transparency of PKI (Public Key Infrastructure) and prevent single point attacks in web communications. However, certificate management based on hierarchical multi-CA architecture often faces the problems of poor scalability and high CPU overhead in blockchain. In this article, we are the first to propose a multi-CA hierarchical certificate blockchain with low overhead. Specifically, a two-layer blockchain structure of the main chain and sub-chain is adopted, with the main chain storing the trust paths and the sub-chain storing the user certificates. By monitoring to the CA transactions of the main chain, the sub-chain is automatically deployed. Then, in the certificate operation, we consider the high CPU overhead of traditional certificate query in blockchain and propose a dual-signature certificate format. combined with the time characteristics of the certificate, a time-partitioned cuckoo filter is proposed with a low false positive rate for the revocation status query speeding, and we find a global performance optimal parameter through mathematical modeling. Finally, we use a general composable framework to prove the security of HiCertChain, and the experiments show that the CPU overhead and false positive rate are reduced by 90% and 95%, respectively, compared with those of state-of-the-arts.
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1776-1790
Watch the Rhythm: Breaking Privacy with Accelerometer at the Extremely-Low Sampling Rate of 5Hz
Considering the threat from on-board eavesdropping with smartphone motion sensors, Android 12 has limited the maximum sampling rate of motion sensors to 200Hz for zero-privilege access to prevent potential wiretapping. Unfortunately, there have been some attacks targeting 200Hz, making it not a safe sampling rate any more. Smartphone manufacturers may further reduce the maximum sampling rate of the accelerometer in response to this privacy concern. It can be expected that, the maximum sampling rate will gradually decrease to a very low level, as the battle between manufacturers and adversaries continues. Existing on-board eavesdropping approaches, utilizing spectral features, cannot provide acceptable accuracy at very low sampling rates, not even at 50Hz. Therefore, this paper explores the feasibility of using the on-board accelerometer for privacy breaking with an extremely-low sampling rate, specifically, 5Hz. 5Hz is a minimum sampling rate to meet normal use, otherwise the applications can only choose to work without the accelerometer. Since the lowest fundamental frequency for humans is around 85Hz, such a low sampling rate poses a significant challenge for sound recognition. According to Nyquist's law, it seems impossible to capture 85Hz with the sampling rate of 5Hz. Fortunately, we observe that the rhythm features, including pause rhythm and intensity rhythm, of accelerometer data are relatively stable at various sampling rates. On this basis, we propose an eavesdropping approach with the accelerometer at an extremely-low sampling rate. Introducing the rhythm features, we achieve an accuracy of 95.09% at 50Hz and 78.66% at 5Hz for scene recognition. The accuracy is 90.60% at 50Hz and 47% at 5Hz for Chinese digits recognition, plus 96.63% at 50Hz and 58.67% at 5Hz for popular Chinese cities recognition. Furthermore, we achieve determination for typical places like bar, metro, bus, car, and quiet room, by analyzing the vibration of surroundings, with an average accuracy of 91.28%. Combining place determination with eavesdropping, our approach poses a serious threat to personal privacy. Since 5Hz is generally used for screen orientation detection, our attack can hide in any kind of application, not just in game or sport applications. We also suggest some countermeasures.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1776-1790
Open AccessWatch the Rhythm: Breaking Privacy with Accelerometer at the Extremely-Low Sampling Rate of 5Hz
Considering the threat from on-board eavesdropping with smartphone motion sensors, Android 12 has limited the maximum sampling rate of motion sensors to 200Hz for zero-privilege access to prevent potential wiretapping. Unfortunately, there have been some attacks targeting 200Hz, making it not a safe sampling rate any more. Smartphone manufacturers may further reduce the maximum sampling rate of the accelerometer in response to this privacy concern. It can be expected that, the maximum sampling rate will gradually decrease to a very low level, as the battle between manufacturers and adversaries continues. Existing on-board eavesdropping approaches, utilizing spectral features, cannot provide acceptable accuracy at very low sampling rates, not even at 50Hz. Therefore, this paper explores the feasibility of using the on-board accelerometer for privacy breaking with an extremely-low sampling rate, specifically, 5Hz. 5Hz is a minimum sampling rate to meet normal use, otherwise the applications can only choose to work without the accelerometer. Since the lowest fundamental frequency for humans is around 85Hz, such a low sampling rate poses a significant challenge for sound recognition. According to Nyquist's law, it seems impossible to capture 85Hz with the sampling rate of 5Hz. Fortunately, we observe that the rhythm features, including pause rhythm and intensity rhythm, of accelerometer data are relatively stable at various sampling rates. On this basis, we propose an eavesdropping approach with the accelerometer at an extremely-low sampling rate. Introducing the rhythm features, we achieve an accuracy of 95.09% at 50Hz and 78.66% at 5Hz for scene recognition. The accuracy is 90.60% at 50Hz and 47% at 5Hz for Chinese digits recognition, plus 96.63% at 50Hz and 58.67% at 5Hz for popular Chinese cities recognition. Furthermore, we achieve determination for typical places like bar, metro, bus, car, and quiet room, by analyzing the vibration of surroundings, with an average accuracy of 91.28%. Combining place determination with eavesdropping, our approach poses a serious threat to personal privacy. Since 5Hz is generally used for screen orientation detection, our attack can hide in any kind of application, not just in game or sport applications. We also suggest some countermeasures.
- 28 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 13 (3) , 841-850
DND: Deep Learning-Based Directed Network Disintegrator
Network disintegration is a fundamental problem in network science, the core of which is how to determine the smallest set of nodes whose removal can weaken the function of the network and quickly paralyze it. It is computationally NP-hard and usually cannot be solved in polynomial time complexity. Many network disintegration methods have been proposed, but they mainly focus on undirected networks. Due to the complex structure of directed networks and the fact that it is necessary to consider the direction of edges to aggregate neighbor node information, solving the disintegration problem of directed networks is a challenge. Inspired by machine learning technology to solve the network disintegration problem, this paper studies feasible disintegration methods in directed networks and proposes a deep learning-based framework, DND (directed network disintegrator), for directed network disintegration, which has a small time complexity when dismantling large directed networks. DND can be trained in small, artificially generated synthetic directed networks and then applied to real-world, complex application scenarios. To test the disintegration effect of DND, we conducted extensive experiments on different types of synthetic directed networks and compared them with other methods. The experimental results show that the disintegration effect of DND is weaker than the CoreHD method, and better than the disintegration method based on local structural features, but the disintegration speed is the fastest with the increase in network size. We also disintegrate directed networks in the real world, and DND achieves a better disintegration effect, providing new insights into solving complex network-related problems and enabling us to design more robust networks to withstand attacks and failures.
- 28 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 13 (3) , 841-850
DND: Deep Learning-Based Directed Network Disintegrator
Network disintegration is a fundamental problem in network science, the core of which is how to determine the smallest set of nodes whose removal can weaken the function of the network and quickly paralyze it. It is computationally NP-hard and usually cannot be solved in polynomial time complexity. Many network disintegration methods have been proposed, but they mainly focus on undirected networks. Due to the complex structure of directed networks and the fact that it is necessary to consider the direction of edges to aggregate neighbor node information, solving the disintegration problem of directed networks is a challenge. Inspired by machine learning technology to solve the network disintegration problem, this paper studies feasible disintegration methods in directed networks and proposes a deep learning-based framework, DND (directed network disintegrator), for directed network disintegration, which has a small time complexity when dismantling large directed networks. DND can be trained in small, artificially generated synthetic directed networks and then applied to real-world, complex application scenarios. To test the disintegration effect of DND, we conducted extensive experiments on different types of synthetic directed networks and compared them with other methods. The experimental results show that the disintegration effect of DND is weaker than the CoreHD method, and better than the disintegration method based on local structural features, but the disintegration speed is the fastest with the increase in network size. We also disintegrate directed networks in the real world, and DND achieves a better disintegration effect, providing new insights into solving complex network-related problems and enabling us to design more robust networks to withstand attacks and failures.
- 1 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (7) , 4313-4326
Load Balancing of Double Queues and Utility-Workload Tradeoff in Heterogeneous Mobile Edge Computing
Mobile edge computing (MEC) is a popular service paradigm by which mobile devices can offload their latency-sensitive and computation-intensive workloads to edge servers. The MEC service scheduling problem has been investigated in recent years. However, most MEC service scheduling mechanisms only consider workloads on homogeneous edge servers, causing servers’ queue backlogs to be too large when innumerable user requests arrive concurrently. In this paper, we are the first to propose a double-queue workloads scheduling model innovatively, and formulate a system (including user ends and edge server ends) utility into a scheduling optimization problem. To tackle such an NP scheduling problem, we present a Lyapunov-based decomposition strategy to convert the original problem into three equivalent subproblems. By aggregating three subproblem solving strategies, we propose the Lyapunov-based online matching algorithm for edge service scheduling, named LOMES, to obtain an optimal system utility while guaranteeing the load balancing of mobile devices and heterogeneous edge servers. Simulations further validate that LOMES realizes the load balancing of two queue lengths and a [ O (1/ V ); O(V) ] tradeoff between the system’s utility and workloads with a utility-workload tradeoff parameter V .
- 1 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (7) , 4313-4326
Load Balancing of Double Queues and Utility-Workload Tradeoff in Heterogeneous Mobile Edge Computing
Mobile edge computing (MEC) is a popular service paradigm by which mobile devices can offload their latency-sensitive and computation-intensive workloads to edge servers. The MEC service scheduling problem has been investigated in recent years. However, most MEC service scheduling mechanisms only consider workloads on homogeneous edge servers, causing servers’ queue backlogs to be too large when innumerable user requests arrive concurrently. In this paper, we are the first to propose a double-queue workloads scheduling model innovatively, and formulate a system (including user ends and edge server ends) utility into a scheduling optimization problem. To tackle such an NP scheduling problem, we present a Lyapunov-based decomposition strategy to convert the original problem into three equivalent subproblems. By aggregating three subproblem solving strategies, we propose the Lyapunov-based online matching algorithm for edge service scheduling, named LOMES, to obtain an optimal system utility while guaranteeing the load balancing of mobile devices and heterogeneous edge servers. Simulations further validate that LOMES realizes the load balancing of two queue lengths and a [ O (1/ V ); O(V) ] tradeoff between the system’s utility and workloads with a utility-workload tradeoff parameter V .
- 14 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (6) , 1554-1567
Performance-Power Tradeoff in Heterogeneous SaaS Clouds With Trustworthiness Guarantee
Software-as-a-service (SaaS) clouds grow dramatically due to cost-effectiveness, availability, and flexibility. Quality of service (QoS) and power, which represent performance and cost, respectively, are conflicting yet critical issues in the service scheduling of SaaS clouds, and some researchers have investigated the tradeoff between them. However, existing works do not involve QoS attacks in which untrusted service providers provide fake QoS values to absorb service requests, resulting in lower user experience and system profits. In this paper, we jointly consider the QoS performance, queue congestion, and energy consumption to formulate the performance-power tradeoff while considering QoS attacks. To address this NP scheduling problem, we propose a Lyapunov-based decomposition strategy that converts the original problem into three equivalent subproblems. By aggregating the solving strategies for the three subproblems, we develop the online service selection and trustworthiness management algorithm that optimizes the performancepower tradeoff while resisting QoS attacks. In addition, a light-weighted trustworthiness management strategy is designed to update trustworthiness values without storing large amounts of past information. Mathematical analyses and simulations demonstrate that our proposed control framework realizes detection and resistance of QoS attacks and a $[O(1 / V), O(V)]$ tradeoff between performance and power with a performance-power tradeoff parameter V.
- 14 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (6) , 1554-1567
Performance-Power Tradeoff in Heterogeneous SaaS Clouds With Trustworthiness Guarantee
Software-as-a-service (SaaS) clouds grow dramatically due to cost-effectiveness, availability, and flexibility. Quality of service (QoS) and power, which represent performance and cost, respectively, are conflicting yet critical issues in the service scheduling of SaaS clouds, and some researchers have investigated the tradeoff between them. However, existing works do not involve QoS attacks in which untrusted service providers provide fake QoS values to absorb service requests, resulting in lower user experience and system profits. In this paper, we jointly consider the QoS performance, queue congestion, and energy consumption to formulate the performance-power tradeoff while considering QoS attacks. To address this NP scheduling problem, we propose a Lyapunov-based decomposition strategy that converts the original problem into three equivalent subproblems. By aggregating the solving strategies for the three subproblems, we develop the online service selection and trustworthiness management algorithm that optimizes the performancepower tradeoff while resisting QoS attacks. In addition, a light-weighted trustworthiness management strategy is designed to update trustworthiness values without storing large amounts of past information. Mathematical analyses and simulations demonstrate that our proposed control framework realizes detection and resistance of QoS attacks and a $[O(1 / V), O(V)]$ tradeoff between performance and power with a performance-power tradeoff parameter V.
- 6 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 70 (5) , 4646-4656
Towards Flexible and Truthful Incentive for Multichannel Allocation in DSA
Due to its potential of increasing spectrum utilization, dynamic spectrum access (DSA) is a promising platform to solve the so-called spectrum shortage problem, caused by a huge proliferation of wireless applications and services. Because of good allocation efficiency and fairness, auction based mechanisms have been extensively studied in DSA, in which truthfulness is a critical property to guarantee that each bidder can obtain her maximal utility by bidding with her true valuation of bidding spectrum. However, existing spectrum auction mechanisms on homogenous channels strictly require bidders to bid one channel or multiple channels with continuous demands, and does not consider the noncontinuous demands for channels. In this paper, we propose THIMBLE, the first TrutHful Incentive Mechanism for flexiBle muLtichannEl allocation by considering bidders' continuous/noncontinuous demands for channels and spatial reusability. Specifically, bidders using the same channel without interference are formulated to a group, and a group bid recalculation method is presented for noncontinuous group bids. Next, a winner selection and charging method based on group bids is designed to achieve truthfulness. Extensive simulation results show that THIMBLE achieves not only truthfulness in continuous and noncontinuous channel demand cases, but also as good spectrum allocation efficiency as existing spectrum auction mechanisms.
- 6 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 70 (5) , 4646-4656
Towards Flexible and Truthful Incentive for Multichannel Allocation in DSA
Due to its potential of increasing spectrum utilization, dynamic spectrum access (DSA) is a promising platform to solve the so-called spectrum shortage problem, caused by a huge proliferation of wireless applications and services. Because of good allocation efficiency and fairness, auction based mechanisms have been extensively studied in DSA, in which truthfulness is a critical property to guarantee that each bidder can obtain her maximal utility by bidding with her true valuation of bidding spectrum. However, existing spectrum auction mechanisms on homogenous channels strictly require bidders to bid one channel or multiple channels with continuous demands, and does not consider the noncontinuous demands for channels. In this paper, we propose THIMBLE, the first TrutHful Incentive Mechanism for flexiBle muLtichannEl allocation by considering bidders' continuous/noncontinuous demands for channels and spatial reusability. Specifically, bidders using the same channel without interference are formulated to a group, and a group bid recalculation method is presented for noncontinuous group bids. Next, a winner selection and charging method based on group bids is designed to achieve truthfulness. Extensive simulation results show that THIMBLE achieves not only truthfulness in continuous and noncontinuous channel demand cases, but also as good spectrum allocation efficiency as existing spectrum auction mechanisms.
- 8 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (10) , 8032-8043
Optimal Mobile Crowdsensing Incentive Under Sensing Inaccuracy
Due to the pervasive adoption of sensor-embedded mobile devices yet increasing demand on data and computing resources, mobile crowdsensing is a promising paradigm with rapid growth. One of the most challenging issues is how to maximize the utilities of crowdsensing platforms under inaccurate distributed sensing. The nature of such inaccuracy is due to the fact that energy-based sensing can be greatly impacted by thermal and environmental noise, which significantly affects task allocation strategies of crowdsensing platforms. Because of allocation efficiency and fairness concerns, auction-based mechanisms have been extensively used in crowdsensing systems. However, existing auction-based mechanisms for crowdsensing do not take sensing inaccuracy into consideration, while guaranteeing that each participator obtains her maximal utility by bidding with her true cost for tasks. To tackle this issue, in this paper we propose OSIER, an Optimal mobile crowdSensing Incentive under sEnsing inaccuRacy. Specifically, a quantitative analytical framework on characterizing the impact of sensing inaccuracy on a crowdsensing platform is presented, and an optimization problem involving sensing inaccuracy is solved to achieve a maximum utility of the platform. Furthermore, depending on whether a user needs to perform all tasks simultaneously or not, indivisible tasks and divisible tasks are discussed, and OSIER-I and OSIER-D are presented for these two kinds of tasks. Simulation results verify the truthfulness of OSIER, and given a sample set with 5%-20% noise in spectrum sensing, OSIER can achieve 10% higher utilities than existing crowdsensing mechanisms on average.
- 8 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (10) , 8032-8043
Optimal Mobile Crowdsensing Incentive Under Sensing Inaccuracy
Due to the pervasive adoption of sensor-embedded mobile devices yet increasing demand on data and computing resources, mobile crowdsensing is a promising paradigm with rapid growth. One of the most challenging issues is how to maximize the utilities of crowdsensing platforms under inaccurate distributed sensing. The nature of such inaccuracy is due to the fact that energy-based sensing can be greatly impacted by thermal and environmental noise, which significantly affects task allocation strategies of crowdsensing platforms. Because of allocation efficiency and fairness concerns, auction-based mechanisms have been extensively used in crowdsensing systems. However, existing auction-based mechanisms for crowdsensing do not take sensing inaccuracy into consideration, while guaranteeing that each participator obtains her maximal utility by bidding with her true cost for tasks. To tackle this issue, in this paper we propose OSIER, an Optimal mobile crowdSensing Incentive under sEnsing inaccuRacy. Specifically, a quantitative analytical framework on characterizing the impact of sensing inaccuracy on a crowdsensing platform is presented, and an optimization problem involving sensing inaccuracy is solved to achieve a maximum utility of the platform. Furthermore, depending on whether a user needs to perform all tasks simultaneously or not, indivisible tasks and divisible tasks are discussed, and OSIER-I and OSIER-D are presented for these two kinds of tasks. Simulation results verify the truthfulness of OSIER, and given a sample set with 5%-20% noise in spectrum sensing, OSIER can achieve 10% higher utilities than existing crowdsensing mechanisms on average.
- Open Access
- 12 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 77964-77980
Energy-Aware RFID Authentication in Edge Computing
Internet of Things (IoT) devices are basic units in Edge Computing. Denial of service (DoS) attack is a great threat to low-cost IoT devices, even worse in privacy-preserving authentication protocols for Radio Frequency Identification (RFID) tags. During DoS attacks, the attacker consumes the legal states in a target tag by continuous scanning and further observes its behavior in authentication to break privacy. Due to lack of adequate energy and computing power, it is hard for passive backscattering RFID tags to defend against DoS attacks. In this work, we cast a new insight on the DoS attacks to RFID tags and leverage the malicious scanning behavior as a new energy source. In this way, a passive tag gains more and more energy and can afford more and more complex cryptography computation under a DoS attack. Finally, the victim tag with adequate energy achieves to complete the complicated public key cryptographic computations and defend against the DoS attack. We further propose a protocol, namely the RUND protocol. We define the tracking privacy model and introduce in the notion of tracking interval to define the tracking privacy other than indistinguishable privacy. To guarantee the security and tracking privacy properties of our protocol, we propose 3 rules as designing guidelines. The analysis shows that our approach can achieve O(1) efficiency while providing DoS-defending privacy-preserving authentication. Furthermore, with proper parameters our approach can save about 40% boosting time at least, compared to the directly charging for public key cryptographic computation method.
- 12 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 77964-77980
Open AccessEnergy-Aware RFID Authentication in Edge Computing
Internet of Things (IoT) devices are basic units in Edge Computing. Denial of service (DoS) attack is a great threat to low-cost IoT devices, even worse in privacy-preserving authentication protocols for Radio Frequency Identification (RFID) tags. During DoS attacks, the attacker consumes the legal states in a target tag by continuous scanning and further observes its behavior in authentication to break privacy. Due to lack of adequate energy and computing power, it is hard for passive backscattering RFID tags to defend against DoS attacks. In this work, we cast a new insight on the DoS attacks to RFID tags and leverage the malicious scanning behavior as a new energy source. In this way, a passive tag gains more and more energy and can afford more and more complex cryptography computation under a DoS attack. Finally, the victim tag with adequate energy achieves to complete the complicated public key cryptographic computations and defend against the DoS attack. We further propose a protocol, namely the RUND protocol. We define the tracking privacy model and introduce in the notion of tracking interval to define the tracking privacy other than indistinguishable privacy. To guarantee the security and tracking privacy properties of our protocol, we propose 3 rules as designing guidelines. The analysis shows that our approach can achieve O(1) efficiency while providing DoS-defending privacy-preserving authentication. Furthermore, with proper parameters our approach can save about 40% boosting time at least, compared to the directly charging for public key cryptographic computation method.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
Certia: Certifying Interface Automata for Cyber-Physical Systems
Interface automaton is a promising approach to model the temporal behaviors of system components, and its extension has been used to specify the security properties of component based systems. Currently, the formal properties of interface automata have not be certified with machine-checked proof by any proof assistant. In this work, we propose a Coq-library of interface automata which is developed in purpose to certify security properties of component-based cyber-physical systems, with an emphasis upon developing compositional verification of information flow security for cyber-physical applications.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
Certia: Certifying Interface Automata for Cyber-Physical Systems
Interface automaton is a promising approach to model the temporal behaviors of system components, and its extension has been used to specify the security properties of component based systems. Currently, the formal properties of interface automata have not be certified with machine-checked proof by any proof assistant. In this work, we propose a Coq-library of interface automata which is developed in purpose to certify security properties of component-based cyber-physical systems, with an emphasis upon developing compositional verification of information flow security for cyber-physical applications.