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

Keyong Hong

dblp:358/5751 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0004-9995-4329ORCID · corroborated

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

Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
3 papers
Cryptographic primitives and cryptanalysis · 35% Authentication and access control · 31% Blockchain and cryptocurrency security · 12%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
iot security
1.012026
Forward secure bilateral access control for end-cloud collaborative Internet of Things · Sci. China Inf. Sci. 2026
Authentication and access control
access control
1.012026
Forward secure bilateral access control for end-cloud collaborative Internet of Things · Sci. China Inf. Sci. 2026
Authentication and access control › policy-based access control
bilateral access control
1.012026
Forward secure bilateral access control for end-cloud collaborative Internet of Things · Sci. China Inf. Sci. 2026
Blockchain and cryptocurrency security › blockchain applications
non-fungible tokens
0.912025
Towards Authorization and Batch Validation for NFTs: A Cryptographic Generic Framework · IEEE Trans. Dependable Secur. Comput. 2025
Digital forensics and information hiding
watermarking
0.912025
Towards Authorization and Batch Validation for NFTs: A Cryptographic Generic Framework · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
0.712023
ABCrowdMed: A Fine-Grained Worker Selection Scheme for Crowdsourcing Healthcare With Privacy-Preserving · IEEE Trans. Serv. Comput. 2023
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
ciphertext-policy attribute-based encryption
0.712023
ABCrowdMed: A Fine-Grained Worker Selection Scheme for Crowdsourcing Healthcare With Privacy-Preserving · IEEE Trans. Serv. Comput. 2023
Privacy and data protection › privacy-preserving computation
privacy-preserving crowdsourcing
0.712023
ABCrowdMed: A Fine-Grained Worker Selection Scheme for Crowdsourcing Healthcare With Privacy-Preserving · IEEE Trans. Serv. Comput. 2023
Cryptographic primitives and cryptanalysis › provable security › security notions
forward security
0.312026
Forward secure bilateral access control for end-cloud collaborative Internet of Things · Sci. China Inf. Sci. 2026
Authentication and access control
revocation
0.212023
ABCrowdMed: A Fine-Grained Worker Selection Scheme for Crowdsourcing Healthcare With Privacy-Preserving · IEEE Trans. Serv. Comput. 2023

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

challenge-response protocol · 0.9batch verification · 0.9verifiable outsourcing decryption · 0.7online/offline encryption · 0.7hidden policy · 0.7
YearPublicationVenuePosition
2026 Forward secure bilateral access control for end-cloud collaborative Internet of Things
Keyong Hong, Chuang Tian 0001, Dilxat Ghopur
Sci. China Inf. Sci.1
2025 Towards Authorization and Batch Validation for NFTs: A Cryptographic Generic Framework
abstract
The rapid growth in the NFT (Non-fungible token) market has offered a wide variety of opportunities for scammers, fraudsters, wash tradings, and so on. One of the most urgent security issues is how to efficiently authorize and validate the ownership to make the NFT ecosystem avoid infringement and counterfeiting. By exploiting linear homomorphic tagging and robust digital watermarking technologies, this article proposes a generic framework for ownership authorization and batch validation of NFTs. Within this framework, the digital artwork creators can authorize the ownership to a buyer before the NFT is minted in the public blockchain. Anytime in the future who questions the ownership of a claimant can initiate a validation procedure to get an auditing report by running a Challenge-Response protocol that supports efficient batch verification. The completeness and soundness of the proposed framework have been proven by assuming a secure homomorphic tag scheme and a robust watermarking scheme. We also present instantiations of the generic construction, especially with$\Pi _{Pub}$, one can outsource the validation procedure to the public blockchain to release local computation burden. A series of elaborated experiments have shown our proposed framework is practical and efficient.
Tao Wang 0039, Keyong Hong, Bo Yang 0003, Qiliang Yang, Wenzheng Zhang 0001
IEEE Trans. Dependable Secur. Comput.2
2023 ABCrowdMed: A Fine-Grained Worker Selection Scheme for Crowdsourcing Healthcare With Privacy-Preserving
abstract
Crowdsourcing for healthcare, which is an application of crowd intelligence, has become a novel and important auxiliary way for traditional healthcare, showing a huge application perspective. In a crowdsourcing platform for healthcare, patients can act as requesters who recruit workers, such as doctors, to provide professional advice by posting a task. However, privacy concerns pose a significant obstacle for patients willing to participate in crowdsourcing, as task data often contain sensitive personal information. To address this issue, we propose a novel attribute-based, lightweight, and dynamic fine-grained worker selection scheme, called ABCrowdMed, with privacy-preserving features. With this scheme, requesters can select workers in a non-interactive way by using a novel CP-ABE scheme that incorporates online/offline encryption, verifiable outsourcing decryption, revocation, and hidden policy properties. Additionally, requesters can revoke and update their tasks by withdrawing some workers’ decryption privileges. Participants can also release the computation burden with the aid of a third-party server. The proposed scheme’s security has been proven to be selectively secure under the decisional$ (q-1)$assumption and satisfies forward/backward security. The performance of ABCrowdMed has been evaluated and compared with state-of-art schemes, with the results demonstrating that our scheme achieves the lowest computation and is suitable for resource-constrained settings.
Tao Wang 0039, Bo Yang 0003, Qiliang Yang, Wenzheng Zhang 0001, Keyong Hong
IEEE Trans. Serv. Comput.6