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

Qiaohan Chu

dblp:364/5429 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
8since 2021 · last 2026
0000-0002-1260-3672ORCID · reported

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

Security and privacy · 5 · 1 first-author · 5 since 2021Computer networks · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 62% Privacy and data protection · 19% Authentication and access control · 19%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Authentication and access control › policy-based access control
bilateral access control
0.912025
Flexible Privacy-Preserving Data Computing With Bilateral Access Control for Cloud-Assisted IoT · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis
functional encryption
0.912025
Flexible Privacy-Preserving Data Computing With Bilateral Access Control for Cloud-Assisted IoT · IEEE Trans. Dependable Secur. Comput. 2025
Privacy and data protection
privacy-preserving data processing
0.912025
Flexible Privacy-Preserving Data Computing With Bilateral Access Control for Cloud-Assisted IoT · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.712023
Improved Fully Adaptive Decentralized MA-ABE for NC1 from MDDH · ASIACRYPT (5) 2023
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
multi-authority attribute-based encryption
0.712023
Improved Fully Adaptive Decentralized MA-ABE for NC1 from MDDH · ASIACRYPT (5) 2023
Cryptographic primitives and cryptanalysis
pairing-based cryptography
0.712023
Improved Fully Adaptive Decentralized MA-ABE for NC1 from MDDH · ASIACRYPT (5) 2023
Internet of things and sensor networks › iot architecture
cloud-assisted iot
0.312025
Flexible Privacy-Preserving Data Computing With Bilateral Access Control for Cloud-Assisted IoT · IEEE Trans. Dependable Secur. Comput. 2025

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

matchmaking encryption · 1.7inner-product functional encryption · 0.9inner product functional encryption · 0.9dual system encryption · 0.7MDDH assumption · 0.7
YearPublicationVenuePosition
2026 Single-Round Privacy-Preserving Emergency Alert Protocol for High-Speed V2X Communications
Ximeng Liu, Qiaohan Chu, Haibin Zheng, Qianhong Wu
IEEE Internet Things J.3
2025 Multi-signer Locally Verifiable Aggregate Signature from (Leveled) Multilinear Maps
Jie Chen 0021, Qiaohan Chu, Qiuyan Du, Luping Wang 0001
ICICS (1)3
2025 Flexible Privacy-Preserving Data Computing With Bilateral Access Control for Cloud-Assisted IoT
abstract
Cloud-assisted Internet of Things (IoT) is a new paradigm to compensate for the disadvantage of limited resources in IoT and extend the functional boundary of IoT. How to preserve the data privacy while identifying the data source in cloud-assisted IoT is a huge challenge and many cryptographic primitives such as matchmaking encryption (ME) are hence introduced to reach this goal. However, we observe that these tools fail to deal with some rigorous cases in which the data owner does not want anyone to disclose the entire data and even authorized users can only obtain a specified part. In this paper, to address such issue, we design a privacy-preserving data computing system with bilateral access control (PDCS-BAC) for cloud-assisted IoT based on a new primitive called identity-based matchmaking functional encryption (IB-MFE). We give the formal definition and security model of IB-MFE, then present two concrete IB-MFE schemes for inner-product function. Thus, PDCS-BAC manages to simultaneously provide flexible privacy computation with enhanced data privacy, bilateral access control, and data authenticity. Finally, we conduct comprehensive performance evaluations to demonstrate the practicability of our schemes for cloud-assisted IoT.
Jie Chen 0021, Jianting Ning, Qiaohan Chu, Luping Wang 0001
IEEE Trans. Dependable Secur. Comput.4
2024 PPA-DCA: A Privacy-Preserving and Accountable Data Collection and Analysis Scheme Using Decentralized Multi-client Functional Encryption
Meixin Chen, Jie Chen 0021, Qiaohan Chu
ProvSec (1)4
2024 Partially-hiding functional encryption for degree-2 polynomials with fine-grained access control
Haifeng Qian, Qiaohan Chu, Jie Chen 0021
Frontiers Comput. Sci.3
2024 Tightly secure (H)IBE in the random oracle model
Qiaohan Chu, Jie Chen 0021
Theor. Comput. Sci.1
2023 Improved Fully Adaptive Decentralized MA-ABE for NC1 from MDDH
Jie Chen 0021, Qiaohan Chu, Ying Gao 0006, Jianting Ning, Luping Wang 0001
ASIACRYPT (5)2
2023 Inner-Product Matchmaking Encryption: Bilateral Access Control and Beyond Equality
abstract
We present an inner‐product matchmaking encryption (IP‐ME) scheme achieving weak privacy and authenticity in prime‐order groups under symmetric external Diffie–Hellman (SXDH) assumption in the standard model. We further present an IP‐ME with Monotone Span Program Authenticity (IP‐ME with MSP Auth) scheme, where the chosen sender policy is upgraded to MSP, and the scheme also achieves weak privacy and authenticity in prime‐order groups under SXDH assumption in the standard model. Both of the schemes have more expressive functionalities than identity‐based matchmaking encryption (IB‐ME) scheme, and are simpler than Ateniese et al.’s modular ME scheme (Crypto’ 19). But our schemes only achieve a very limited flavor of security, which is reflected in the privacy.
Qiaohan Chu, Anmin Fu, Haifeng Qian, Jie Chen 0021
IET Inf. Secur.1