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

Zihan Hao

dblp:336/4675 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2026
0009-0006-7381-6280ORCID · corroborated

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

Security and privacy · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 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 · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
functional encryption
1.522024
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation · EUROCRYPT (2) 2024
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE · CRYPTO (3) 2024
Cryptographic primitives and cryptanalysis › functional encryption
laconic function evaluation
1.522024
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation · EUROCRYPT (2) 2024
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE · CRYPTO (3) 2024
Computational complexity
space complexity
1.012026
On the Need for (Quantum) Memory with Short Outputs · STOC 2026
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.812024
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE · CRYPTO (3) 2024
Computational complexity › query complexity
quantum query complexity
0.312026
On the Need for (Quantum) Memory with Short Outputs · STOC 2026
Cryptographic primitives and cryptanalysis
obfuscation
0.212024
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation · EUROCRYPT (2) 2024

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

nested collision finding · 1.0ring-LWE · 0.8lattice-based cryptography · 0.8
YearPublicationVenuePosition
2026 On the Need for (Quantum) Memory with Short Outputs
abstract
In this work, we establish the first separation between computation with bounded and unbounded space, for problems with short outputs (i.e., working memory can be exponentially larger than output size), both in the classical and the quantum setting. Towards that, we introduce a problem called nested collision finding, and show that optimal query complexity can not be achieved without exponential memory.
Zihan Hao, Zikuan Huang, Qipeng Liu 0001
STOC1
2024 Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE
Fangqi Dong, Zihan Hao, Ethan Mook, Hoeteck Wee, Daniel Wichs
CRYPTO (3)2
2024 Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation
Fangqi Dong, Zihan Hao, Ethan Mook, Daniel Wichs
EUROCRYPT (2)2
2024 Tensor-Based Channel Estimation for Millimeter-Wave Massive MIMO by Exploiting Sparsity in Delay-Angular Domain
abstract
Millimeter-wave massive multiple-input multiple-output employing a large-scale antenna array is a promising technology for 5G and 6G cellular networks. It also provides strong support for high-speed, low-latency communications and diverse applications. In order to enhance the accuracy and efficiency of channel estimation, in this paper, we formulate a tensor-based channel estimation model with sparse regularization aiming at characterizing the sparse structure of a large-scale channel in the delay-angular domain. An efficient subspace Newton least squares algorithm is designed to solve the nonconvex discontinuous tensor-based model, operating in restricted subspaces and being capable of handling singularities of the Hessian matrix. Our proposed algorithm is also proved to enjoy global and linear (or sublinear) convergence. Some numerical simulations are performed, which demonstrate the feasibility of our proposed model and the time validity of our algorithm.
Zihan Hao, Ziyan Luo
IEEE Trans. Wirel. Commun.1
2022 An Interpretable Time Series Clustering Neural Network Based on Shape Feature Extraction
abstract
Time series is a very common but important data type. A large number of time series data are generated in various professional research fields and daily life. Although there are many models being developed to deal with time series, the cluster methods for time series are insufficient and need to improve. This paper is focused on time series clustering, which uses deep learning approach to discover the shape characteristics of time series. We establish a new neural network model of time series clustering to jointly optimize the representation learning and clustering tasks of time series. Focusing on shape features with time series, we built the Soft-DTW layer into the neural network to learn the interpretable time series representation. Maximized regularization mutual information is used to jointly optimize representation learning and clustering tasks. Experiments show that this model can help obtain an excellent representation of time series. In comparison with the benchmark model, the best clustering effect is achieved in the proposed model on multiple data sets. This model has broad applicability in time series data.
Weide Li, Zihan Hao, Zhihe Zhang
Int. J. Pattern Recognit. Artif. Intell.2