Xinghao Peng

dblp:390/8831 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
0009-0007-3652-9378ORCID · corroborated

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

Security and privacy · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
YearPublicationVenuePosition
2025 ConsCS: Effective and Efficient Verification of Circom Circuits
abstract
Circom is a popular programming language for writing arithmetic circuits that can be used to generate zero-knowledge proofs (ZKPs) like zk-SNARKS. ZKPs have received tremendous attention in protocols like zkRollups. The Circom circuits are compiled to Rank-1 Constraint Systems (R1CS) circuits, based on which zk-SNARK proofs are generated. However, one major challenge associated with R1CS circuits is the problem of under-constrained circuits, which are susceptible to allowing incorrect computations to pass verification due to insufficient constraints, potentially leading to security vulnerabilities. In this paper, we propose a novel framework CONSCS to automatically verify Circom circuits. Our contributions are threefold: 1) we propose novel circuit inference rules to help reduce the size of circuits and to extract more comprehensive information than existing works; 2) we introduce the novel Binary Property Graph (BPG) as a highly efficient reasoning engine, outperforming all existing tools in effectiveness and efficiency; 3) we leverage fine-grained domain-specific information to guide the SMT solving to address non-linear constraints, increasing the success rate of SMT queries of existing works from 2.68% to 48.84%. We conduct experiments to show that CONSCS enhances the solved rate of existing works from around 50-60% to above 80%.
Jinan Jiang, Xinghao Peng, Jinzhao Chu, Xiapu Luo
ICSE2
2025 Automated Soundness and Completeness Vetting of Polygon zkEVM
Xinghao Peng, Kunsong Zhao, Zuchao Ma, Zihao Li 0001, Jinan Jiang, Xiapu Luo, Yinqian Zhang
USENIX Security Symposium1
2024 fAmulet: Finding Finalization Failure Bugs in Polygon zkRollup
abstract
Zero-knowledge layer 2 protocols emerge as a compelling approach to overcoming blockchain scalability issues by processing transactions through the transaction finalization process. During this process, transactions are efficiently processed off the main chain. Besides, both the transaction data and the zero-knowledge proofs of transaction executions are reserved on the main chain, ensuring the availability of transaction data as well as the correctness and verifiability of transaction executions. Hence, any bugs that cause the transaction finalization failure are crucial, as they impair the usability of these protocols and the scalability of blockchains.
Zihao Li 0001, Xinghao Peng, Zheyuan He, Xiapu Luo, Ting Chen 0002
CCS2
2024 DoubleUp Roll: Double-spending in Arbitrum by Rolling It Back
abstract
Optimistic rollup protocols are widely adopted as the most popular blockchain scaling solutions. As a dominant implementation, Arbitrum has boasted a total locked value exceeding 18 billion USD, highlighting the significance of optimistic rollups in blockchain ecosystem. Despite their popularity, little research has been done on the security of optimistic rollup protocols, and potential vulnerabilities on them remain unknown.
Zihao Li 0001, Xinghao Peng, Xiapu Luo, Muhui Jiang, Hao Zhou 0043, Yinqian Zhang
CCS3
2024 PEBTrack: A Performance-Efficiency Balance Tracker for Aerial Scenario
Xuesen Ma, Xiuxuan Yu, Xinghao Peng
ICONIP (8)3