Binyi Chen

37 papers A* 3A 1Journal 18Unranked 14
YearRankTypeTitle / Venue / Authors
2025 — conf
Blaze: Fast SNARKs from Interleaved RAA Codes.
EUROCRYPT (4)
Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger
2025 — conf
LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems.
CRYPTO (7)
Dan Boneh, Binyi Chen
2025 J jnl
LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems.
IACR Cryptol. ePrint Arch.
Dan Boneh, Binyi Chen
2025 — conf
LatticeFold: A Lattice-Based Folding Scheme and Its Applications to Succinct Proof Systems.
ASIACRYPT (3)
Dan Boneh, Binyi Chen
2025 — conf
Pairing-Based Batch Arguments for NP with a Linear-Size CRS.
ASIACRYPT (5)
Binyi Chen, Noel Elias, David J. Wu
2025 J jnl
Pairing-Based Batch Arguments for NP with a Linear-Size CRS.
IACR Cryptol. ePrint Arch.
Binyi Chen, Noel Elias, David J. Wu
2025 J jnl
Symphony: Scalable SNARKs in the Random Oracle Model from Lattice-Based High-Arity Folding.
IACR Cryptol. ePrint Arch.
Binyi Chen
2025 A* conf
VerITAS: Verifying Image Transformations at Scale.
SP
Trisha Datta, Binyi Chen, Dan Boneh
2024 — conf
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes.
CRYPTO (10)
Hadas Zeilberger, Binyi Chen, Ben Fisch
2024 J jnl
Blaze: Fast SNARKs from Interleaved RAA Codes.
IACR Cryptol. ePrint Arch.
Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger
2024 J jnl
LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems.
IACR Cryptol. ePrint Arch.
Dan Boneh, Binyi Chen
2024 — conf
LatticeGen: Hiding Generated Text in a Lattice for Privacy-Aware Large Language Model Generation on Cloud.
NAACL-HLT (Findings)
Mengke Zhang, Tianxing He, Tianle Wang, Lu Mi, Niloofar Mireshghallah, Binyi Chen, Hao Wang, Yulia Tsvetkov
2024 — conf
Mangrove: A Scalable Framework for Folding-Based SNARKs.
CRYPTO (10)
Wilson D. Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi, Dan Boneh
2024 J jnl
Mangrove: A Scalable Framework for Folding-based SNARKs.
IACR Cryptol. ePrint Arch.
Wilson D. Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi, Dan Boneh
2024 J jnl
The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange.
IACR Cryptol. ePrint Arch.
Jeb Bearer, Benedikt Bünz, Philippe Camacho, Binyi Chen, Ellie Davidson, Ben Fisch, Brendon Fish, Gus Gutoski, Fernando Krell, Chengyu Lin, Dahlia Malkhi, Kartik Nayak, Keyao Shen, Alex Luoyuan Xiong, Nathan Yospe
2024 J jnl
VerITAS: Verifying Image Transformations at Scale.
IACR Cryptol. ePrint Arch.
Trisha Datta, Binyi Chen, Dan Boneh
2023 J jnl
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes.
IACR Cryptol. ePrint Arch.
Hadas Zeilberger, Binyi Chen, Ben Fisch
2023 — conf
HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates.
EUROCRYPT (2)
Binyi Chen, Benedikt Bünz, Dan Boneh, Zhenfei Zhang
2023 J jnl
LatticeGen: A Cooperative Framework which Hides Generated Text in a Lattice for Privacy-Aware Generation on Cloud.
CoRR
Mengke Zhang, Tianxing He, Tianle Wang, Lu Mi, Fatemehsadat Mireshghallah, Binyi Chen, Hao Wang, Yulia Tsvetkov
2023 J jnl
ProtoStar: Generic Efficient Accumulation/Folding for Special Sound Protocols.
IACR Cryptol. ePrint Arch.
Benedikt Bünz, Binyi Chen
2023 — conf
Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols.
ASIACRYPT (2)
Benedikt Bünz, Binyi Chen
2023 A* conf
VeriZexe: Decentralized Private Computation with Universal Setup.
USENIX Security Symposium
Alex Luoyuan Xiong, Binyi Chen, Zhenfei Zhang, Benedikt Bünz, Ben Fisch, Fernando Krell, Philippe Camacho
2022 J jnl
HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates.
IACR Cryptol. ePrint Arch.
Binyi Chen, Benedikt Bünz, Dan Boneh, Zhenfei Zhang
2022 J jnl
VERI-ZEXE: Decentralized Private Computation with Universal Setup.
IACR Cryptol. ePrint Arch.
Alex Luoyuan Xiong, Binyi Chen, Zhenfei Zhang, Benedikt Bünz, Ben Fisch, Fernando Krell, Philippe Camacho
2019 J jnl
Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space.
IACR Cryptol. ePrint Arch.
Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee
2019 — conf
Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space.
CRYPTO (1)
Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee
2019 — conf
Memory-Hard Functions from Cryptographic Primitives.
CRYPTO (2)
Binyi Chen, Stefano Tessaro
2019 — —
Memory-Hard Functions: When Theory Meets Practice.
Binyi Chen
2017 — conf
Scrypt Is Maximally Memory-Hard.
EUROCRYPT (3)
Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro
2016 — conf
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions.
TCC (A2)
Binyi Chen, Huijia Lin, Stefano Tessaro
2016 — conf
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
EUROCRYPT (2)
Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro
2016 J jnl
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
IACR Cryptol. ePrint Arch.
Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro
2016 J jnl
Scrypt is Maximally Memory-Hard.
IACR Cryptol. ePrint Arch.
Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro
2015 A conf
Mechanism Design for Daily Deals.
AAMAS
Binyi Chen, Tao Qin, Tie-Yan Liu
2015 J jnl
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions.
IACR Cryptol. ePrint Arch.
Binyi Chen, Huijia Lin, Stefano Tessaro
2013 J jnl
$K$-anonymous Signaling Scheme.
CoRR
Binyi Chen, Tao Qin, Tie-Yan Liu
2013 A* conf
Collaborative Topic Regression with Social Regularization for Tag Recommendation.
IJCAI
Hao Wang, Binyi Chen, Wu-Jun Li