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

Peifang Ni

dblp:216/6079 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
5since 2021 · last 2026
0000-0003-3656-7431ORCID · corroborated

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

Security and privacy · 8 · 3 first-author · 5 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
5 papers
Blockchain and cryptocurrency security · 58% Cryptographic protocols and secure computation · 27% Cryptographic primitives and cryptanalysis · 15%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
payment channel network
1.122025
Horcrux: Synthesize, Split, Shift and Stay Alive; Preventing Channel Depletion via Universal and Enhanced Multi-hop Payments · NDSS 2025
Warning! The Timeout T Cannot Protect You From Losing Coins: PipeSwap: Forcing the Timely Release of a Secret for Atomic Cross-Chain Swaps · SP 2025
Cryptographic protocols and secure computation
leader election
1.012026
Mobius: Enabling Byzantine-Resilient Single Secret Leader Election with Uniquely Verifiable State · NDSS 2026
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
adaptor signatures
0.912025
Warning! The Timeout T Cannot Protect You From Losing Coins: PipeSwap: Forcing the Timely Release of a Secret for Atomic Cross-Chain Swaps · SP 2025
Blockchain and cryptocurrency security › blockchain interoperability
cross-chain exchange
0.912025
Warning! The Timeout T Cannot Protect You From Losing Coins: PipeSwap: Forcing the Timely Release of a Secret for Atomic Cross-Chain Swaps · SP 2025
Blockchain and cryptocurrency security › consensus protocol
bitcoin backbone protocol
0.412020
Analysis of bitcoin backbone protocol in the non-flat model · Sci. China Inf. Sci. 2020
Distributed systems › fault tolerance
byzantine fault tolerance
0.312026
Mobius: Enabling Byzantine-Resilient Single Secret Leader Election with Uniquely Verifiable State · NDSS 2026
Cryptographic protocols and secure computation › commitment schemes
timed commitments
0.312025
Warning! The Timeout T Cannot Protect You From Losing Coins: PipeSwap: Forcing the Timely Release of a Secret for Atomic Cross-Chain Swaps · SP 2025
Distributed systems
consensus
0.312025
Chitin: A Security-Enhanced Proof-of-Stake Protocol With View-Interference Resilience · IEEE Trans. Inf. Forensics Secur. 2025
Distributed systems › consensus › permissionless consensus
proof-of-stake
0.312025
Chitin: A Security-Enhanced Proof-of-Stake Protocol With View-Interference Resilience · IEEE Trans. Inf. Forensics Secur. 2025
Distributed computing theory
consensus
0.112020
Analysis of bitcoin backbone protocol in the non-flat model · Sci. China Inf. Sci. 2020

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

universal composability · 0.9schnorr signatures · 0.9cryptographic protocols · 0.9ECDSA · 0.9
YearPublicationVenuePosition
2026 Mobius: Enabling Byzantine-Resilient Single Secret Leader Election with Uniquely Verifiable State
Hanyue Dou, Peifang Ni, Yingzi Gao, Jing Xu 0002
NDSS2
2025 Horcrux: Synthesize, Split, Shift and Stay Alive; Preventing Channel Depletion via Universal and Enhanced Multi-hop Payments
Anqi Tian, Peifang Ni, Yingzi Gao, Jing Xu 0002
NDSS2
2025 Warning! The Timeout T Cannot Protect You From Losing Coins: PipeSwap: Forcing the Timely Release of a Secret for Atomic Cross-Chain Swaps
abstract
Atomic cross-chain swaps mitigate the interoper-ability challenges faced by current cryptocurrencies, thereby facilitating inter-currency exchange and trading between the distrusting users. Although numerous atomic swaps protocols utilizing Hash Timelock Contracts have been deployed and put into practice, they are substantially far from universality due to their inherent dependence of rich scripting language supported by the underlying blockchains. The recently proposed Universal Atomic Swaps protocol [IEEE S&P'22] represents a significant advancement in the field of scriptless cross-chain swaps by ingeniously delegating scripting functionalities to cryptographic locking mechanisms, particularly the adaptor signatures and timed commitment schemes. However, we identify a new form of attack termed the double-claiming attack that leverages these scriptless functionalities to undermine atomicity with a high probability. This attack is inherent to the designs adopted by the existing scriptless cross-chain swaps protocols as well as the payment channel networks. We further quantify the severity of this attack based on real-word swap transactions processed by the most widely deployed decentralized exchange platforms, highlighting the critical challenges in designing universal atomic swaps. To address the double-claiming attack while ensuring both security and practical universality, we also present a cross-chain swaps protocol called PipeSwap. Specifically, PipeSwap protects the frozen coins from being double-claimed by a novelly designed paradigm of pipelined coins flow that utilizes the techniques of two-hop swap and two-hop refund. In addition to a comprehensive security analysis in the Universal Composability framework, we develop a proof-of-concept implementation of PipeSwap with Schnorr/ECDSA signatures, and conduct extensive experiments to evaluate the overhead. The experimental results show that PipeSwap can be performed in less than 1.7 seconds while maintaining less than 7 kb of communication overhead on commodity machines.
Peifang Ni, Anqi Tian, Jing Xu 0002
SP1
2025 ppLeader: Achieving the Privacy-Preserving Leaders in PoS Protocols
Peifang Ni, Jing Xu 0002
J. Inf. Secur. Appl.1
2025 Chitin: A Security-Enhanced Proof-of-Stake Protocol With View-Interference Resilience
Hanyue Dou, Peifang Ni, Jing Xu 0002
IEEE Trans. Inf. Forensics Secur.2
2020 Analysis of bitcoin backbone protocol in the non-flat model
Peifang Ni, Hongda Li 0001, Dongxue Pan
Sci. China Inf. Sci.1
2019 Witness Encryption with (Weak) Unique Decryption and Message Indistinguishability: Constructions and Applications
Dongxue Pan, Bei Liang, Hongda Li 0001, Peifang Ni
ACISP4
2019 Hierarchical Functional Signcryption: Notion and Construction
Dongxue Pan, Bei Liang, Hongda Li 0001, Peifang Ni
ProvSec4
2018 Micropaying to a Distributed Payee with Instant Confirmation
Peifang Ni, Hongda Li 0001, Dongxue Pan
ICICS1