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

Huiying Hou

dblp:216/5999 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
4since 2021 · last 2023
0000-0002-6994-1955ORCID · corroborated

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

Security and privacy · 3 · 2 first-author · 3 since 2021Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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
Network security · 20% Authentication and access control · 20% Cryptographic primitives and cryptanalysis · 20%
Computer networks
1 paper
Vehicular, aerial and satellite networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Vehicular, aerial and satellite networks
vehicular ad hoc networks
0.612022
A Traitor-Resistant and Dynamic Anonymous Communication Service for Cloud-Based VANETs · IEEE Trans. Serv. Comput. 2022
Authentication and access control
anonymous authentication
0.612022
A Traitor-Resistant and Dynamic Anonymous Communication Service for Cloud-Based VANETs · IEEE Trans. Serv. Comput. 2022
Network security › anonymity networks
anonymous communication
0.612022
A Traitor-Resistant and Dynamic Anonymous Communication Service for Cloud-Based VANETs · IEEE Trans. Serv. Comput. 2022
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.612022
A Traitor-Resistant and Dynamic Anonymous Communication Service for Cloud-Based VANETs · IEEE Trans. Serv. Comput. 2022
Digital forensics and information hiding › attack investigation
malicious user tracing
0.612022
Fine-Grained and Controllably Editable Data Sharing With Accountability in Cloud Storage · IEEE Trans. Dependable Secur. Comput. 2022
Cryptographic protocols and secure computation
secure data sharing
0.612022
Fine-Grained and Controllably Editable Data Sharing With Accountability in Cloud Storage · IEEE Trans. Dependable Secur. Comput. 2022
Cloud and datacenter computing
cloud storage
0.212022
Fine-Grained and Controllably Editable Data Sharing With Accountability in Cloud Storage · IEEE Trans. Dependable Secur. Comput. 2022

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

signature conversion · 1.1fine-grained access control policy · 1.1binary tree algorithm · 1.1
YearPublicationVenuePosition
2023 Privacy-preserving certificateless public auditing supporting different auditing frequencies
Wenting Shen, Jing Qin 0002, Huiying Hou
Comput. Secur.4
2022 Fine-Grained and Controllably Editable Data Sharing With Accountability in Cloud Storage
abstract
With the increasing cloud storage service, users can enjoy non-interactive data sharing. Nonetheless, the data owner cannot timely update the shared data all the while. To ensure the timeliness and the authoritative source of the data, some users should be allowed to update the data on behalf of an authoritative data owner without changing data source. However, this allows harmful information to be injected into the data unnoticeably. How to efficiently realize editable cloud-based data sharing supporting malicious user tracing has not been fully explored. To address the problem, we propose a fine-grained and controllably editable cloud-based data sharing scheme with malicious user accountability. The data owner only needs to sign the shared data before uploading it and can specify a fine-grained access control policy about who can update the data and which portions of the data can be updated. The authorized users non-interactively convert signatures of original data into new ones for the updated data, which are indistinguishable from the original signatures. The proposed scheme also supports malicious user accountability in the sense that malicious users who post harmful information can be traced. We demonstrate the security and practicality of our scheme via formal security analysis and extensive experiments.
Huiying Hou, Jianting Ning, Yunlei Zhao, Robert H. Deng
IEEE Trans. Dependable Secur. Comput.1
2022 A Traitor-Resistant and Dynamic Anonymous Communication Service for Cloud-Based VANETs
abstract
Cloud-based VANETs are designed to enable communication between high-speed vehicles. In such a highly dynamic environment, how to provide secure and anonymous communication service is a challenge. In this article, we affirmatively address the challenge by proposing a traitor-resistant and dynamic anonymous communication framework (TD-ACF) for cloud-based VANETs, which supports several advantageous features. In TD-ACF, each vehicle is represented by a set of attributes instead of its real identity, and the driving data is transmitted in encrypted form. Therefore, the anonymous authentication and the confidentiality of driving data are achieved in this way. Meanwhile, TD-ACF supports two practical requirements in cloud-based VANETs: the revocation and the traceability of traitor. For the former, TD-ACF can force a vehicle to exit the communication network at any moment. We employ an efficient binary tree algorithm to reduce the size of key updates for revocation from the traditional linear to the logarithmic level. For the latter, we overcome the barrier of the one-to-many relationship between a vehicle and the shared set of attributes to support traitor tracing. In TD-ACF, unlike most existing schemes, the Semi-Trusted Cloud (STC) can directly capture and punish a traitor instead of querying all the records in the list of unrevoked vehicles. In addition, we solve the key escrow problem that plagues most existing attribute-based schemes. The theoretical analysis and experimental simulation show that the proposed scheme is feasible and effective.
Huiying Hou, Jianting Ning, Yunlei Zhao, Robert H. Deng
IEEE Trans. Serv. Comput.1
2021 Fine-Grained and Controllably Redactable Blockchain with Harmful Data Forced Removal
abstract
Notoriously, immutability is one of the most striking properties of blockchains. As the data contained in blockchains may be compelled to redact for personal and legal reasons, immutability needs to be skillfully broken. In most existing redactable blockchains, fine-grained redaction and effective deletion of harmful data are mutually exclusive. To close the gap, we propose a fine-grained and controllably redactable blockchain with harmful data forced removal. In the scheme, the originator of the transaction has fine-grained control over who can perform the redaction and which portions of the transaction can be redacted. The redaction transaction is performed after collecting enough votes from miners. All users can provide the index of the block containing the harmful data to receive rewards, which are borne by the malicious user who initially posted the data. Miners can forcibly remove the harmful data based on the index. The malicious user will be blacklisted if the reward is not paid within a period of time, and any transaction about such user will not be performed later. In addition, the scheme supports the redaction of additional data and unexpended transaction output (UTXO) simultaneously. We demonstrate that the scheme is secure and feasible via formal security analysis and proof-of-concept implementation.
Huiying Hou, Shidi Hao, Jiaming Yuan, Shengmin Xu, Yunlei Zhao
Secur. Commun. Networks1
2019 Cloud storage auditing with deduplication supporting different security levels according to data popularity
Huiying Hou, Jia Yu 0003, Rong Hao
J. Netw. Comput. Appl.1