Bo Peng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bo Peng has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Mingqi Lu
Northeastern University
2 shared publications - Zhengzhong Jin
Northeastern University
2 shared publications - Ashrujit Ghoshal
Indian Institute of Technology Madras, Chennai, India
1 shared publication - Bo Zhao
School of AI Shanghai Jiao Tong University
1 shared publication - Elaine Shi
Carnegie Mellon University
1 shared publication - Fei Hu
Peking University
1 shared publication
Latest Publications
- Open Access
- 11 August 2026
- Published by Springer Nature
- p. 214-242
Succinct Non-interactive Arguments for Distributions
- 11 August 2026
- Published by Springer Nature
- p. 214-242
Open AccessSuccinct Non-interactive Arguments for Distributions
- Open Access
- 9 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1812-1823
SNARKs from LWE via Non-black-Box Reductions
We construct the first succinct non-interactive arguments of knowledge (SNARKs) from the polynomial-hardness of Learning with Errors (LWE) for a subclass of UP languages whose witness unambiguity has a polynomial-size Extended Frege (EF) proof. Our construction achieves the following soundness guarantee: For any fixed sequence of false instances {xλ}λ∈ℕ, there exists a (non-constructive) constant c>0 such that, whenever the uniform random CRS length exceeds λc, the construction achieves infinitely-often soundness for this sequence {xλ}λ∈ℕ: for any polynomial-time cheating prover {Aλ}λ∈ℕ, the probability that Aλ outputs an accepting proof for xλ is negligible for infinitely many λ. As intermediate results, we also obtain: (1) SNARGs for any NP language that has polynomial-size EF proofs of witness unambiguity for all instances outside of the language, based on polynomial-hard LWE, achieving the same style of soundness guarantee. (2) SNARKs for all true instances in any language L ∈ UP where every instance has a polynomial-size EF proof of witness unambiguity, under polynomial hardness of LWE, without soundness guarantees for false instances. To achieve our main result, we employ a non-black-box soundness reduction. Along the way, we introduce a new logical proof system, the Cryptographic Extended Frege (CEF) system, which extends EF with rules for formalizing the indistinguishability in cryptographic security proofs. Building on the Encrypt-hash-and-BARG framework of [Jin–Kalai–Lombardi–Vaikuntanathan, STOC’24], we further obtain SNARGs for NP languages that have CEF proofs of non-membership, which may be of independent interest.
- 9 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1812-1823
Open AccessSNARKs from LWE via Non-black-Box Reductions
We construct the first succinct non-interactive arguments of knowledge (SNARKs) from the polynomial-hardness of Learning with Errors (LWE) for a subclass of UP languages whose witness unambiguity has a polynomial-size Extended Frege (EF) proof. Our construction achieves the following soundness guarantee: For any fixed sequence of false instances {xλ}λ∈ℕ, there exists a (non-constructive) constant c>0 such that, whenever the uniform random CRS length exceeds λc, the construction achieves infinitely-often soundness for this sequence {xλ}λ∈ℕ: for any polynomial-time cheating prover {Aλ}λ∈ℕ, the probability that Aλ outputs an accepting proof for xλ is negligible for infinitely many λ. As intermediate results, we also obtain: (1) SNARGs for any NP language that has polynomial-size EF proofs of witness unambiguity for all instances outside of the language, based on polynomial-hard LWE, achieving the same style of soundness guarantee. (2) SNARKs for all true instances in any language L ∈ UP where every instance has a polynomial-size EF proof of witness unambiguity, under polynomial hardness of LWE, without soundness guarantees for false instances. To achieve our main result, we employ a non-black-box soundness reduction. Along the way, we introduce a new logical proof system, the Cryptographic Extended Frege (CEF) system, which extends EF with rules for formalizing the indistinguishability in cryptographic security proofs. Building on the Encrypt-hash-and-BARG framework of [Jin–Kalai–Lombardi–Vaikuntanathan, STOC’24], we further obtain SNARGs for NP languages that have CEF proofs of non-membership, which may be of independent interest.
- 28 April 2025
- Published by Springer Nature
- p. 284-313
Pseudorandom Functions with Weak Programming Privacy and Applications to Private Information Retrieval
- 28 April 2025
- Published by Springer Nature
- p. 284-313
Pseudorandom Functions with Weak Programming Privacy and Applications to Private Information Retrieval
- 1 November 2024
- Published by Springer Nature
- p. 199-216
Omni6DPose: A Benchmark and Model for Universal 6D Object Pose Estimation and Tracking
- 1 November 2024
- Published by Springer Nature
- p. 199-216
Omni6DPose: A Benchmark and Model for Universal 6D Object Pose Estimation and Tracking