Panpan Han

Panpan Han

Auto-generated profile, based on publicly available information

Panpan Han

State Key Laboratory on Integrated Services Networks, School of Cyber Engineering, Xidian University, Xian, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 June 2023 in Distributed Ledger Technologies: Research and Practice
Verified
Journal Article
Open access
PHPanpan Han
Panpan Han
Zheng YanZheng Yan
Zheng Yan
WDWenxiu Ding
Wenxiu Ding
SFShufan Fei
Shufan Fei
ZWZhiguo Wan
Zhiguo Wan
Blockchain has attracted more and more attention of academia, industry, and government in recent decades. Different usage demands have inspired various blockchain designs, forming different blockchain systems, which leads to information islands. Many cross-chain technologies have been proposed to link different blockchains together and expand the utility of blockchain. Nevertheless, the cross-chain technology is still in its infancy, which faces many problems that retard its wide application, for example, the issues related to security, privacy, and effectiveness. In order to further investigate cross-chain technologies, it is essential to understand its current state of arts. Although there are some surveys about cross-chain technologies driven by specific demands, the literature still lacks a comprehensive survey focusing on security, privacy, and effectiveness of cross-chain technologies. In this paper, we provide a review on existing cross-chain technologies based on a comprehensive set of criteria on security, privacy, and other performance. We first propose a blockchain interoperability architecture for the purpose of analyzing potential threats and problems regarding security, privacy, and effectiveness. We then summarize a set of criteria regarding these quality attributes. Next, we comprehensively review the representative works on cross-chain technologies according to a taxonomy based on applied types of techniques and cross-chain purposes. In each work review, we provide a serious discussion on its pros and cons by employing our proposed criteria. Finally, based on our review and analysis, we figure out a number of open issues and step ahead to direct future research directions on cross-chain technologies.

4 March 2026 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
PHPanpan Han
Panpan Han
Zheng YanZheng Yan
Zheng Yan
ZXZhiqiang Xu
Zhiqiang Xu
Laurence YangLaurence Yang
Laurence Yang
EBElisa Bertino
Elisa Bertino
Cross-chain transfer significantly enhances asset management among multiple blockchains. While existing cross-chain transfer schemes facilitate transferring asset ownership of users between a source blockchain and a target blockchain, they do not consider a complex scenario involving $m$ source blockchains and one target blockchain (termed $m \sim 1$ cross-chain transfer). Furthermore, the variants of existing schemes for this scenario fail to concurrently achieve atomicity, unlinkability, and practical properties such as transaction aggregability, and non-collateralization, posing substantial limitations. To bridge this gap, we propose ShiftHub, the first $m \sim 1$ cross-chain transfer scheme that simultaneously fulfills the above desired properties. ShiftHub guarantees atomicity and transaction aggregability by integrating exchange protocols with a novel $t$ -message-clustered redeem protocol. Unlinkability is achieved by additionally incorporating commonly used assumptions such as fixed-amount transfers, while the need for sender collateralization is eliminated by enabling the reuse of locked assets. Compatible with any blockchains that employ adaptor signatures or BLS signatures for transaction authentication, ShiftHub requires only signature verification and timelock functionalities on chain, ensuring near-universal blockchain compatibility. We formally prove the security of ShiftHub under static corruption using the universal composability framework. Extensive evaluation shows that ShiftHub offers superior performance over the existing scheme variant with the closest underlying protocols to ShiftHub, in terms of both off-chain and on-chain overhead, when completing $m \sim 1$ cross-chain transfer. Particularly, ShiftHub reduces the number of required transactions by $(2m-1)/3m$ .

9 September 2025 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
PHPanpan Han
Panpan Han
Zheng YanZheng Yan
Zheng Yan
Laurence YangLaurence Yang
Laurence Yang
EBElisa Bertino
Elisa Bertino
Blockchain-enabled digital currency systems, referred to as blockchains for brevity, have become an important method for asset management. Additionally, numerous efforts have been made to facilitate asset swap between two different blockchains, further enhancing asset circulation. However, few works address the general scenario in which one trader swaps assets from $n_{1}$ different blockchains with another trader using assets from $n_{2}$ different blockchains, referred to as $n_{1} \sim n_{2}$ swap. This paper proposes OSwap, the first $n_{1} \sim n_{2}$ swap scheme that ensures atomicity without relying on synchronous blockchain communication. By leveraging third-party steps from verifiable witness encryption based on threshold signatures (VweTS), OSwap allows privacy-conscious traders to swap assets independently, without interactive third-party involvement. It also integrates verifiable timed discrete logarithm schemes to support asset redemption under abnormal cases, maintaining atomicity and indistinguishability. We formally prove the security of OSwap under the universal composable framework with static corruption. We compare OSwap with the closest existing scheme for successful $n_{1} \sim n_{2}$ swap, where the trader holding assets on $n_{1}$ blockchains pays the counterparty holding assets on $n_{2}$ blockchains first. The comparison demonstrates that OSwap reduces the number of required transactions from $2n_{1} + 2n_{2}$ to $n_{1} + 2n_{2}$, while also supporting a broader range of signature types. Moreover, when fewer than 4 third parties are involved and both $n_{2}$ and the threshold value in VweTS are set to 1, OSwap achieves lower running time cost.