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.

Yunwei Guo

dblp:10/9706 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 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
1 paper
Cryptographic protocols and secure computation · 54% Blockchain and cryptocurrency security · 46%

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

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security › off-chain payment
payment channel
0.912025
CAPE: Commitment-Based Privacy-Preserving Payment Channel Scheme in Blockchain · IEEE Trans. Dependable Secur. Comput. 2025
Blockchain and cryptocurrency security › off-chain payment › payment channel
privacy-preserving payment channel
0.912025
CAPE: Commitment-Based Privacy-Preserving Payment Channel Scheme in Blockchain · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.912025
CAPE: Commitment-Based Privacy-Preserving Payment Channel Scheme in Blockchain · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › non-interactive zero-knowledge proofs
zk-SNARK
0.912025
CAPE: Commitment-Based Privacy-Preserving Payment Channel Scheme in Blockchain · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic protocols and secure computation
commitment schemes
0.312025
CAPE: Commitment-Based Privacy-Preserving Payment Channel Scheme in Blockchain · IEEE Trans. Dependable Secur. Comput. 2025

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

zero-knowledge proofs · 0.9verifiable timed commitment · 0.9commitment scheme · 0.9
YearPublicationVenuePosition
2025 CAPE: Commitment-Based Privacy-Preserving Payment Channel Scheme in Blockchain
abstract
Ensuring scalability in cryptocurrency systems is significant in guaranteeing real-world utility along with the remarkable increment of cryptographic currency. As an alternative in solving scalability issue, payment channel allows users to deliver extensive offline transactions without uploading massive transaction details to the blockchain, such that increasing efficiency can be achieved. However, the implementation of payment channel still encounters privacy concerns when considering the publicly available transaction amounts and the potentials in mining associations between transaction parties. In this paper, we propose a novel payment channel scheme, entitledCommitment-basedAnonymousPayment ChannEl (CAPE), to facilitate unlimited off-chain bidirectional payments while guaranteeing participants’ privacy. The proposed scheme adopts zero-knowledge proof (zk-SNARKs) and verifiable timed (VTD) commitments to ensure the anonymity of the relationship between on-chain and off-chain transactions, privacy of transaction amounts, and security of balances. We comprehensively formalize security definitions and present rigorous proofs for each security attribute. Experiment results further demonstrate the practical viability of CAPE.
Keke Gai, Yunwei Guo, Jing Yu 0007, Weilin Chan, Liehuang Zhu, Yinqian Zhang, Weizhi Meng 0001
IEEE Trans. Dependable Secur. Comput.2
2024 KDTSS: A Blockchain-Based Scheme for Knowledge Data Traceability and Secure Sharing
Haochen Liang, Yunwei Guo, Jing Yu 0007, Keke Gai
KSEM (4)2
2023 Cross-Chain-Based Trustworthy Node Identity Governance in Internet of Things
abstract
As a flourishing technical adoption boosted by 5G technology in recent years, Internet of Things (IoT) has become a common implementation in contemporary network-based solutions, such that tons of IoT devices, seen as nodes in the network, are employed. In order to meet the demands of the network edge, IoT devices mostly have limited computation and storage capabilities; however, this setting also introduces trust and security concerns. One of the noticeable threats is that malicious nodes forge or impersonate other legal nodes’ identities, which results in trustworthiness issues. In this article, we focus on the trust issue of IoT device identities and propose a cross-chain-based solution that applies a reply chain for identifying the legality of device nodes. Our proposed relay chain-based IoT model supports secure and reliable data transmission through the relay chain with the authorization and trust of all IoT blockchains. The relay chain realizes the multiparty verification of IoT devices; thus, addressing the trust problem of device identities. The consensus of the relay chain is executed by the arbitration committee nodes rather than all nodes. Considering the efficiency and adaptability, we also have proposed a novel optimal cross-chain decision-making algorithm to optimize the consensus for the identity-oriented relay chain. The proposed algorithm can minimize the cross-chain overhead while ensuring the fairness of the consensus. Our experiment evaluations have demonstrated that the proposed approach could increase the cross-chain efficiency under triple constraints.
Tianxiu Xie, Keke Gai, Liehuang Zhu, Yunwei Guo, Kim-Kwang Raymond Choo
IEEE Internet Things J.4