Yanpei Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yanpei Guo has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Jiaheng Zhang
National University of Singapore, Singapore, Singapore
3 shared publications - Hongtai Wang
National University of Singapore, Singapore, Singapore
2 shared publications - Hoon Wei Lim
Cyber Special Ops-R&D, NCS Group, Singapore, Singapore
2 shared publications - Jin Song Dong
National University of Singapore, Singapore, Singapore
2 shared publications - Ming Xu
National University of Singapore, Singapore, Singapore
2 shared publications - Weili Han
Fudan University
2 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5478-5492
Melior, Verifiable Mixed-Integer Programming via zkSNARKs
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5478-5492
Open AccessMelior, Verifiable Mixed-Integer Programming via zkSNARKs
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5523-5537
MamaBearZKP: A Holistic Co-design of Prime Fields and Proving Stacks for High-Throughput ZKP on Modern CPUs
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5523-5537
Open AccessMamaBearZKP: A Holistic Co-design of Prime Fields and Proving Stacks for High-Throughput ZKP on Modern CPUs
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2045-2057
RulePilot: An LLM-Powered Agent for Security Rule Generation
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2045-2057
Open AccessRulePilot: An LLM-Powered Agent for Security Rule Generation
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3123-3134
ARuleCon: Agentic Security Rule Conversion
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3123-3134
Open AccessARuleCon: Agentic Security Rule Conversion
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 145-158
Succinct Hash-Based Arbitrary-Range Proofs
Zero-knowledge range proof (ZKRP) asserts that a committed integer V lies in a given range like [0, 2 n −1] without other leakages of V . It is vital in various privacy-preserving systems. Moving forward, the quest for post-quantum security is still in its infancy; the proof size of state-of-the-art lattice-based ZKRP (Lyubashevsky et al ., CCS 20 and Couteau et al ., Eurocrypt 21) remains linear in n , directly impacting the long-term sustainability in applications such as immutable ledgers. Confronting this unresolved impasse, we propose SHARP-PQ, i.e. , succinct hash-based arbitrary-range proof with post-quantum security. SHARP-PQ offers proof size poly-logarithmic to n , optimized batch proofs, and versatile (new) capabilities. Its success stems from the improved inner product argument and exploitation of homomorphism. Empirically, SHARP-PQ features at least 10× smaller proof size for multiple ranges over lattice-based ZKRPs while maintaining competitive prover and verifier times. SHARP-PQ also outperforms ZKRPs directly constructed from hash-based generic zero-knowledge proofs at most 10×.
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 145-158
Succinct Hash-Based Arbitrary-Range Proofs
Zero-knowledge range proof (ZKRP) asserts that a committed integer V lies in a given range like [0, 2 n −1] without other leakages of V . It is vital in various privacy-preserving systems. Moving forward, the quest for post-quantum security is still in its infancy; the proof size of state-of-the-art lattice-based ZKRP (Lyubashevsky et al ., CCS 20 and Couteau et al ., Eurocrypt 21) remains linear in n , directly impacting the long-term sustainability in applications such as immutable ledgers. Confronting this unresolved impasse, we propose SHARP-PQ, i.e. , succinct hash-based arbitrary-range proof with post-quantum security. SHARP-PQ offers proof size poly-logarithmic to n , optimized batch proofs, and versatile (new) capabilities. Its success stems from the improved inner product argument and exploitation of homomorphism. Empirically, SHARP-PQ features at least 10× smaller proof size for multiple ranges over lattice-based ZKRPs while maintaining competitive prover and verifier times. SHARP-PQ also outperforms ZKRPs directly constructed from hash-based generic zero-knowledge proofs at most 10×.