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

Bochao An

dblp:360/1067 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0005-0414-0697ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 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
2 papers
Cryptographic primitives and cryptanalysis · 28% Hardware security and side channels · 28% Authentication and access control · 21%
Computer networks
1 paper
Internet of things and sensor networks · 50% Edge and fog computing · 50%

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

TopicWeightPapersLastEvidence papers
Hardware security and side channels › trusted execution environments
Intel SGX
0.912025
Reducing Paging and Exit Overheads in Intel SGX for Oblivious Conjunctive Keyword Search · IEEE Trans. Computers 2025
Cryptographic primitives and cryptanalysis › searchable encryption › keyword search
oblivious keyword search
0.912025
Reducing Paging and Exit Overheads in Intel SGX for Oblivious Conjunctive Keyword Search · IEEE Trans. Computers 2025
Cryptographic protocols and secure computation › oblivious data structures
oblivious RAM
0.912025
Reducing Paging and Exit Overheads in Intel SGX for Oblivious Conjunctive Keyword Search · IEEE Trans. Computers 2025
Cryptographic primitives and cryptanalysis › searchable encryption
searchable symmetric encryption
0.912025
Reducing Paging and Exit Overheads in Intel SGX for Oblivious Conjunctive Keyword Search · IEEE Trans. Computers 2025
Hardware security and side channels
trusted execution environments
0.912025
Reducing Paging and Exit Overheads in Intel SGX for Oblivious Conjunctive Keyword Search · IEEE Trans. Computers 2025
Authentication and access control
access control
0.712023
A Blockchain-Based Multi-Users Oblivious Data Sharing Scheme for Digital Twin System in Industrial Internet of Things · IEEE J. Sel. Areas Commun. 2023
Blockchain and cryptocurrency security › blockchain data management
blockchain-based data sharing
0.712023
A Blockchain-Based Multi-Users Oblivious Data Sharing Scheme for Digital Twin System in Industrial Internet of Things · IEEE J. Sel. Areas Commun. 2023
Authentication and access control › access control
multi-user access control
0.712023
A Blockchain-Based Multi-Users Oblivious Data Sharing Scheme for Digital Twin System in Industrial Internet of Things · IEEE J. Sel. Areas Commun. 2023
Edge and fog computing
digital twin
0.212023
A Blockchain-Based Multi-Users Oblivious Data Sharing Scheme for Digital Twin System in Industrial Internet of Things · IEEE J. Sel. Areas Commun. 2023
Internet of things and sensor networks
industrial iot
0.212023
A Blockchain-Based Multi-Users Oblivious Data Sharing Scheme for Digital Twin System in Industrial Internet of Things · IEEE J. Sel. Areas Commun. 2023

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

trusted hardware · 1.3cryptography · 1.3bloom filter · 0.9ORAM · 0.9
YearPublicationVenuePosition
2025 Reducing Paging and Exit Overheads in Intel SGX for Oblivious Conjunctive Keyword Search
abstract
Paging and exit overheads have been proven to be the performance bottlenecks when adopting Searchable Symmetric Encryption (SSE) with trusted hardware such as Intel SGX for keyword search. This problem becomes more serious when incorporating ORAM and SGX to design oblivious SSE schemes such as POSUP [1] and Oblidb [2] which can defend against inference attacks. The main reason comes from high round communication complexity of ORAM and constrained trusted memory created by SGX. To overcome this performance bottleneck, we propose a set of novel SSE constructions with realistic security/performance trade-offs. Our core idea is to encode the keyword-identifier pairs into a bloom filter to reduce the number of ORAM operations during the search procedure. Specifically, Construction 1 loads the bloom filter into the enclave sequentially, which outperforms about$1.7\times$when the dataset is large compared with the performance of the baseline that directly combines ORAM and SGX. To further improve the performance of Construction 1, Construction 2 classifies keywords into groups and stores these groups in different bloom filters. By additionally leaking the keywords in search token belonging to which groups, Construction 2 outperforms Construction 1 by$16.5\sim 36.8\times$and provides an improvement of at least one order over state-of-the-art oblivious protocols.
Saiyu Qi, Xu Yang 0033, Yong Qi 0001, Jianfeng Wang 0001, Youshui Lu, Bochao An, Ee-Chien Chang
IEEE Trans. Computers7
2024 Lightweight verifiable blockchain top-k queries
Jingxian Cheng, Saiyu Qi, Bochao An, Yong Qi 0001, Jianfeng Wang 0001, Yanan Qiao
Future Gener. Comput. Syst.3
2023 A Blockchain-Based Multi-Users Oblivious Data Sharing Scheme for Digital Twin System in Industrial Internet of Things
abstract
Digital twin (DT) constructs virtual counterparts of physical devices to monitor and optimize their life cycle processes. With the emergence of industry 4.0, Industrial Internet of Things (IIoT) has became the backbone of the DT by providing a fundamental way to transform physical devices to their virtual counterparts. With the deployment of IIoT, built-in sensors enable real-time collection of critical DT data involving various physical parameters associated with devices during their life cycle. However, traditional data sharing services rely on a centralized infrastructure, which inevitably brings severe security threats to share large volume of sensitive DT data derived from numerous sensors. To address the above issue, this paper presents a blockchain based Multi-users Oblivious Data Sharing scheme (MODS) for the digital twin system in the context of IIoT. MODS supports a broad range of security properties including confidentiality, obliviousness, and access control for the DT data stored on the blockchain. MODS adopts a hybrid design approach by combing trusted hardware and cryptography to achieve well balances between security and efficiency. To demonstrate the design advantages of MODS, we explore the design space of a multi-users oblivious data sharing scheme by using pure cryptographic approach, which incurs several design tradeoffs that must be addressed. We show that MODS performs well in these tradeoffs. A comprehensive evaluation has been conducted to demonstrate that MODS is practical to support secure data sharing via blockchain for IIoT.
Wei Wei 0006, Bochao An, Qiao Ke, Jun Shen 0001
IEEE J. Sel. Areas Commun.2