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.

Zhangxiang Hu

dblp:152/5239 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0001-5441-4848ORCID · corroborated

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

Security and privacy · 3 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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 protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
malicious security
0.212015
How to Efficiently Evaluate RAM Programs with Malicious Security · EUROCRYPT (1) 2015
Cryptographic protocols and secure computation › oblivious data structures
oblivious RAM
0.212015
How to Efficiently Evaluate RAM Programs with Malicious Security · EUROCRYPT (1) 2015
Cryptographic protocols and secure computation › secure computation protocols
secure computation with RAM programs
0.212015
How to Efficiently Evaluate RAM Programs with Malicious Security · EUROCRYPT (1) 2015
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.212015
Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost · CRYPTO (2) 2015

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

malicious security · 0.2cut-and-choose · 0.2
YearPublicationVenuePosition
2025 Causal Encoding Generative Model Based on Attention and KAN
Jing Yang 0008, Xiangbin Meng, Xuanli Qin, Xianjun Xu, Zhangxiang Hu
KSEM (5)5
2024 Resilient Intermediary-Based Key Exchange Protocol for IoT
abstract
Due to the limited resources of Internet of Things (IoT) devices, Symmetric Key Cryptography (SKC) is typically favored over resource-intensive Public Key Cryptography (PKC) to secure communication between IoT devices. To utilize SKC, devices need to execute a key exchange protocol to establish a session key before initiating communication. However, existing SKC-based key exchange protocols assume that communication devices have a pre-shared secret or there are trusted intermediaries between them; neither is always realistic in IoT. We introduce a new SKC-based key exchange protocol for IoT devices. While also intermediary based, our protocol fundamentally departs from existing intermediary-based solutions in that intermediaries between two key exchange devices may be malicious, and moreover, our protocol can detect cheating behaviors and identify malicious intermediaries. We prove our protocol is secure under the universally composable model, and show that it can detect malicious intermediaries with probability 1.0. We implemented and evaluated our protocol on different IoT devices. We show that our protocol has significant improvements in computation time and energy cost. Compared to the PKC-based protocols ECDH, DH, and RSA, our protocol is 2.3 to 1,591 times faster on one of the two key exchange devices and 0.7 to 4.67 times faster on the other.
Zhangxiang Hu, Jun Li 0001
ACM Trans. Internet Things1
2022 Toward a Resilient Key Exchange Protocol for IoT
abstract
In order for resource-constrained Internet of Things (IoT) devices to set up secure communication channels to exchange confidential messages, Symmetric Key Cryptography (SKC) is usually preferred to resource-intensive Public Key Cryptography (PKC). At the core of setting up a secure channel is secure key exchange, the process of two IoT devices securely agreeing on a common session key before they communicate. While compared to using PKC, key exchange using SKC is more resource-aware for IoT environments, it requires either a pre-shared secret or trusted intermediaries between the two devices; neither assumption is realistic in IoT. In this paper, we relax the above assumptions and introduce a new intermediary-based secure key exchange protocol for IoT devices that do not support PKC. With a design that is lightweight and deployable in IoT, our protocol fundamentally departs from existing intermediary-based solutions in that (1) it leverages intermediary parties that can be malicious and (2) it can detect malicious intermediary parties. We provide a formal proof that our protocol is secure and conduct a theoretical analysis to show the failure probability of our protocol is easily negligible with a reasonable setup and its malicious helper detection probability can be 1.0 even when a malicious helper only tampers a small number of messages. We implemented our protocol and our experimental results show that our protocol significantly improves the computation time and energy cost. Dependent on the IoT device type (Raspberry Pi, Arduino Due, or Sam D21) and the PKC algorithms to compare against (ECDH, DH, or RSA), our protocol is 2.3 to 1591 times faster on one of the two devices and 0.7 to 4.67 times faster on the other.
Zhangxiang Hu, Jun Li 0001, Samuel Mergendahl
CODASPY1
2015 Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost
Zhangxiang Hu, Payman Mohassel, Mike Rosulek
CRYPTO (2)1
2015 How to Efficiently Evaluate RAM Programs with Malicious Security
Arash Afshar, Zhangxiang Hu, Payman Mohassel, Mike Rosulek
EUROCRYPT (1)2