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

Peixuan He

dblp:224/0885 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
3since 2021 · last 2025
—ORCID · none

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

Computer networks · 7 · 2 first-author · 2 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
3 papers
Cryptographic primitives and cryptanalysis · 35% Hardware security and side channels · 20% Systems and software security · 20%
Computer networks
2 papers
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
information-centric networking
1.022022
SCD2: Secure Content Delivery and Deduplication With Multiple Content Providers in Information Centric Networking · IEEE/ACM Trans. Netw. 2022
A Secure, Efficient, and Accountable Edge-Based Access Control Framework for Information Centric Networks · IEEE/ACM Trans. Netw. 2019
Systems and software security › trusted computing
enclave security
0.912025
WAVEN: WebAssembly Memory Virtualization for Enclaves · NDSS 2025
Hardware security and side channels
trusted execution environments
0.912025
WAVEN: WebAssembly Memory Virtualization for Enclaves · NDSS 2025
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.612022
SCD2: Secure Content Delivery and Deduplication With Multiple Content Providers in Information Centric Networking · IEEE/ACM Trans. Netw. 2022
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
key-policy attribute-based encryption
0.612022
SCD2: Secure Content Delivery and Deduplication With Multiple Content Providers in Information Centric Networking · IEEE/ACM Trans. Netw. 2022
Internet architecture and protocols › network security
access control
0.412019
A Secure, Efficient, and Accountable Edge-Based Access Control Framework for Information Centric Networks · IEEE/ACM Trans. Netw. 2019
Authentication and access control
anonymous authentication
0.412019
A Secure, Efficient, and Accountable Edge-Based Access Control Framework for Information Centric Networks · IEEE/ACM Trans. Netw. 2019
Network security › attack strategy
denial-of-service attack
0.412019
A Secure, Efficient, and Accountable Edge-Based Access Control Framework for Information Centric Networks · IEEE/ACM Trans. Netw. 2019
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
group signature
0.412019
A Secure, Efficient, and Accountable Edge-Based Access Control Framework for Information Centric Networks · IEEE/ACM Trans. Netw. 2019
Authentication and access control › access control
fine-grained access control
0.212022
SCD2: Secure Content Delivery and Deduplication With Multiple Content Providers in Information Centric Networking · IEEE/ACM Trans. Netw. 2022
Privacy and data protection
anonymity
0.112019
A Secure, Efficient, and Accountable Edge-Based Access Control Framework for Information Centric Networks · IEEE/ACM Trans. Netw. 2019

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

key management · 1.1attribute-based encryption · 1.1webassembly · 0.9memory virtualization · 0.9hash chain · 0.8group signature · 0.8
YearPublicationVenuePosition
2025 WAVEN: WebAssembly Memory Virtualization for Enclaves
Weili Wang 0005, Honghan Ji, Peixuan He, Yinqian Zhang
NDSS3
2022 SCD2: Secure Content Delivery and Deduplication With Multiple Content Providers in Information Centric Networking
abstract
As one of the promising next generation network architectures, information centric networking (ICN) is highly anticipated to improve the bandwidth usage of the Internet and reduce duplicate traffic. Since contents in ICN are disseminated in the whole network, ICN is much more vulnerable and the issue of how to deliver contents securely has been intensively discussed. However, the scalability of the existing schemes is limited. A scalable scheme is expected to be able to achieve fine-grained access control and at the same time also support multiple content providers scenario with efficient key management at user side. Besides, different content providers may publish some identical contents and these contents may be cached in the same intermediate routers, which causes high data redundancy and in turn exerts an adverse impact on the performance of ICN. In this paper, we propose a Secure Content Delivery and Deduplication scheme, called SCD2, to achieve secure and efficient fine-grained access control in ICN with multiple content providers. We first propose a scalable key-policy attribute-based encryption (SKP-ABE) to provide fine-grained access control and allow different attribute authorities to share some public attributes to simplify the key management. Furthermore, based on SKP-ABE, we design a simple but effective mechanism to conduct content deduplication. Finally, we implement a prototype of SCD2 to test its performance and compare it with some existing schemes. The results show that SCD2 has lower storage overhead, a higher degree of deduplication, and better retrieval efficiency.
Kaiping Xue, Peixuan He, Qiudong Xia, David S. L. Wei
IEEE/ACM Trans. Netw.2
2021 FASE: Fine-Grained Accountable and Space-Efficient Access Control for Multimedia Content With In-Network Caching
abstract
To reduce the duplicated traffic and improve the performance of distributing massive volumes of multimedia contents, in-network caching has been proposed recently. However, as in-network content caching can be directly utilized to respond users’ requests, multimedia content retrieval is beyond content providers’ control and makes it hard for them to implement access control and service accounting. In this paper, we propose a Fine-grained Accountable and Space-Efficient access control scheme, called FASE, for multimedia content distribution. FASE allows content providers to be fully offline while making the best of in-network caching. In FASE, the attribute-based encryption at multimedia content provider side and access policy based authentication at the edge router side jointly ensure secure fine-grained access control. Our scheme is efficient in both space and time. By designing one time chameleon signature (OTCS), users can keep anonymous during the authentication, and their privileges can be conveniently revoked when needed. Besides, secure service accounting is implemented by letting edge routers collect service credentials generated during users’ request process. Through formal security analysis, we prove the security of our scheme. Simulation results demonstrate that our scheme is efficient with acceptable overhead.
Peixuan He, Kaiping Xue, Qiudong Xia, Jianqing Liu, David S. L. Wei
IEEE Trans. Netw. Serv. Manag.1
2020 An Efficient Data Aggregation Scheme with Local Differential Privacy in Smart Grid
abstract
Smart grid achieves reliable, efficient and flexible grid data processing by integrating traditional power grid with information and communication technology. The control center can evaluate the supply and demand of the power grid through aggregated data of users, and then dynamically adjust the power supply, price of the power, etc. However, since the grid data collected from users may disclose the user's electricity using habits and daily activities, the privacy concern has become a critical issue. Most of the existing privacy-preserving data collection schemes for smart grid adopt homomorphic encryption or randomization techniques which are either impractical because of the high computation overhead or unrealistic for requiring the trusted third party. In this paper, we propose a privacy-preserving smart grid data aggregation scheme satisfying local differential privacy (LDP) based on randomized response. Our scheme can achieve efficient and practical estimation of the statistics of power supply and demand while preserving any individual participant's privacy. The performance analysis shows that our scheme is efficient in terms of computation and communication overhead.
Na Gai, Kaiping Xue, Peixuan He, Bin Zhu 0010, Jianqing Liu, Debiao He
MSN3
2020 An Efficient, Accountable, and Privacy-Preserving Access Control Scheme for Internet of Things in a Sharing Economy Environment
abstract
The Internet of Things (IoT) has set off a new information technology revolution due to its convenience and efficiency. An IoT enables sharing economy, as more people are willing to share their own things (mostly mobile devices) to leverage the under-used value. In such a situation where owners and users are often not familiar with each other, an efficient access control mechanism is needed to deal with the trust issue and support service accountability to help owners accurately get their deserved profits. Besides, in such a sharing economy environment, the mobility of most shared IoT devices and their privacy preserving should also be taken into account. Regrettably, the existing schemes cannot achieve all of the aforementioned goals simultaneously and only few schemes were implemented to evaluate the claimed performance. In this article, we propose an efficient, accountable, and privacy-preserving access control solution for IoT in a sharing economy environment. In our scheme, we utilize the one-time signature to achieve anonymous authentication and let gateways store the signatures as service credentials for accountability. Meanwhile, we adopt the identity-based authentication to exclude malicious gateways and shared devices from the system and design a specialized protocol for those devices moving with the users. We conduct a detailed security analysis to show that our scheme can effectively defend against potential attacks, and also implement a prototype system to demonstrate that our design is indeed an efficient one.
Yu Liu 0031, Kaiping Xue, Peixuan He, David S. L. Wei, Mohsen Guizani
IEEE Internet Things J.3
2019 TSLS: Time Sensitive, Lightweight and Secure Access Control for Information Centric Networking
abstract
Information Centric Networking (ICN), a new paradigm of Internet infrastructure, aims to better accommodate users' rapid growing demand for content delivery and optimize bandwidth utilization. Although the in-network cache feature of ICN facilitates the dissemination of content to users, it also poses new challenges on access control for content and network resource. Moreover, it is common that the access privilege of content dynamically change over time. However, existing access control mechanisms in ICN cannot support the publication and distribution of such time-sensitive content. In this paper, we propose a time- sensitive, lightweight, and secure access control mechanism, called TSLS, to solve this problem. We introduce broadcast encryption combined with time tokens for content providers to protect content confidentiality, and only authorized users satisfying the time limitation have capability to decrypt and access the content. Besides, a fast lightweight challenge-response verification is implemented at the edge routers to block unauthorized request from injecting into the network. The responses of authorized users are forwarded to content providers for pre-distribute popular content at in-network caches in advance. Our security analysis shows that TSLS possesses the properties of data confidentiality, unforgeability, anonymity, and DoS/DDoS attacks resistance. Our simulation results indicate that our proposed TSLS is an efficient mechanism with low computation cost and network delay.
Qiudong Xia, Peixuan He, Kaiping Xue, Jiangping Han, David S. L. Wei, Hao Yue 0001
GLOBECOM2
2019 Attribute-Based Accountable Access Control for Multimedia Content with In-Network Caching
abstract
Nowadays, multimedia content retrieval has become the major service requirement of the Internet and the traffic of these contents has dominated the IP traffic. To reduce the duplicated traffic and improve the performance of distributing massive volumes of multimedia contents, in-network caching has been proposed recently. However, because in-network content caching can be directly utilized to respond users' requests, multimedia content retrieval is beyond content providers' control and makes it hard for them to implement access control and service accounting. In this paper, we propose an attribute-based accountable access control scheme for multimedia content distribution while making the best of in-network caching, in which content providers can be fully offline. In our scheme, the attribute-based encryption at multimedia content provider side and access policy based authentication at the edge router side jointly ensure the secure access control, which is also efficient in both space and time. Besides, secure service accounting is implemented by letting edge routers collect service credentials generated during users' request process. Through the informal security analysis, we prove the security of our scheme. Simulation results demonstrate that our scheme is efficient with acceptable overhead.
Peixuan He, Kaiping Xue, Jie Xu 0031, Qiudong Xia, Jianqing Liu, Hao Yue 0001
ICME1
2019 A Secure, Efficient, and Accountable Edge-Based Access Control Framework for Information Centric Networks
abstract
Information centric networking (ICN) has been regarded as an ideal architecture for the next-generation network to handle users' increasing demand for content delivery with in-network cache. While making better use of network resources and providing better service delivery, an effective access control mechanism is needed due to the widely disseminated contents. However, in the existing solutions, making cache-enabled routers or content providers authenticate users' requests causes high computation overhead and unnecessary delay. Also, the straight-forward utilization of advanced encryption algorithms makes the system vulnerable to DoS attacks. Besides, privacy protection and service accountability are rarely taken into account in this scenario. In this paper, we propose SEAF, a secure, efficient, and accountable edge-based access control framework for ICN, in which authentication is performed at the network edge to block unauthorized requests at the very beginning. We adopt group signature to achieve anonymous authentication and use hash chain technique to reduce greatly the overhead when users make continuous requests for the same file. At the same time, we provide an efficient revocation method to make our framework more robust. Furthermore, the content providers can affirm the service amount received from the network and extract feedback information from the signatures and hash chains. By formal security analysis and the comparison with related works, we show that SEAF achieves the expected security goals and possesses more useful features. The experimental results also demonstrate that our design is efficient for routers and content providers and bring in only slight delay for users' content retrieval.
Kaiping Xue, Peixuan He, Qiudong Xia, David S. L. Wei, Hao Yue 0001, Feng Wu 0001
IEEE/ACM Trans. Netw.2
2018 LASA: Lightweight, Auditable and Secure Access Control in ICN with Limitation of Access Times
abstract
Information Centric Networking (ICN), a future network architecture candidate, aims to alleviate the problem of insufficient bandwidth in traditional IP network. In ICN, contents are distributed in the whole network, so access control becomes more intractable. As we know, almost all of existing solutions consider it as a "Yes or No" problem, where a user either has the permission to access the corresponding content or not. However, in many practical situations, a content provider doesn't expect a single authorized user has the ability to access its repertory without times limitation when taking copyright protection into account. In this paper, we propose LASA, a lightweight, auditable and secure solution where legitimate users are limited to access a content provider's data within pre-designate times. In LASA, each content provider sets maximum access times for each legitimate user and edge routers perform authentication and audit based on users' signatures attached to interest packets. Once a legitimate user attempts to exceed his/her limited access times, his/her secret key will be leaked and the dishonest behavior will be detected. Our security analysis shows that LASA can provide signature unforgeability, data confidentiality and other security features. Experiment results show that our scheme LASA brings a little computational cost.
Peixuan He, Yinxin Wan, Qiudong Xia, Shaohua Li 0002, Jianan Hong, Kaiping Xue
ICC1