(Authors are listed in alphabetical order by last name, unless an asterisk(*) is indicated.)
-
Mangrove: A Scalable Framework for Folding-based SNARKs
(link)
* Wilson Nguyen,
Trisha Datta,
Binyi Chen
Nirvan Tyagi,
Dan Boneh
Preprint.
-
LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems
(link)
Dan Boneh,
Binyi Chen
Preprint.
-
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes
(link)
* Hadas Zeilberger, Binyi Chen, Ben Fisch
Preprint.
-
LatticeGen: A Cooperative Framework which Hides Generated Text in a Lattice for Privacy-Aware Generation on Cloud
(link)
* Mengke Zhang,
Tianxing He,
Tianle Wang,
Lu Mi,
Fatemehsadat Mireshghallah,
Binyi Chen,
Hao Wang,
Yulia Tsvetkov
NAACL 2024.
-
ProtoStar: Generic Efficient Accumulation/Folding for Special Sound
Protocols (link)
Benedikt Bünz, Binyi Chen
ASIACRYPT 2023.
-
Hyperplonk: Plonk with linear-time prover and high-degree custom gates
(link)
* Binyi Chen,
Benedikt Bünz,
Dan Boneh,
Zhenfei Zhang
EUROCRYPT 2023.
-
VeriZexe: Decentralized Private Computation with Universal Setup
(link)
* Alex Xiong,
Binyi Chen,
Zhenfei Zhang,
Benedikt Bünz,
Ben Fisch,
Fernando Krell,
Philippe Camacho
USENIX Security 2023.
-
Continuous space-bounded non-malleable codes from stronger proofs-of-space
(link)
Binyi Chen,
Yilei Chen,
Kristina Hostakova,
Pratyay Mukherjee
CRYPTO 2019.
-
Memory-hard functions from cryptographic primitives
(link)
Binyi Chen,
Stefano Tessaro
CRYPTO 2019.
-
Scrypt is maximally memory-hard
(link)
Joël Alwen,
Binyi Chen,
Krzysztof Pietrzak,
Leonid Reyzin,
Stefano Tessaro
EUROCRYPT 2017 (Best Paper Award).
-
On the complexity of scrypt and proofs of space in the parallel random oracle model
(link)
Joël Alwen,
Binyi Chen,
Chethan Kamath,
Vladimir Kolmogorov,
Krzysztof Pietrzak,
Stefano Tessaro
EUROCRYPT 2016.
-
Oblivious parallel RAM: improved efficiency and generic constructions
(link)
Binyi Chen,
Huijia Lin
Stefano Tessaro
TCC 2016-A.
-
Mechanism design for daily deals
(link)
*
Binyi Chen,
Tao Qin
Tie-Yan Liu
AAMAS 2015.
-
K-anonymous Signaling Scheme
(link)
*
Binyi Chen,
Tao Qin
Tie-Yan Liu
arXiv 2013.
-
Collaborative topic regression with social regularization for tag recommendation
(link)
*
Hao Wang,
Binyi Chen,
Wu-Jun Li
IJCAI 2013.
-
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes
- at University of California, Berkleley, Crypto Seminar, 2024
- at Stanford University, Crypto Reading Group, 2024
- at Privacy & Scaling Explorations (supported by Ethereum Foundation), 2024 (link)
-
ProtoStar: Generic Efficient Accumulation/Folding for Special Sound Protocols
- at Stanford Blockchain Conference, 2023
- at ZK Study Club, 2023 (link)
- at Privacy & Scaling Explorations (supported by Ethereum Foundation), 2023 (link)
-
Hyperplonk: Plonk with linear-time prover and high-degree custom gates
- at New York University, Crypto Seminar, 2023
- at ZK Study Club, 2022 (link)
- at University of California, Berkleley, Zero Knowledge Proof Workshop (affiliated with CESC), 2022
-
Scrypt is maximally memory-hard
- at EUROCRYPT Best Paper Award Talk, 2017
-
On the complexity of scrypt and proofs of space in the parallel random oracle model
-
Oblivious parallel RAM: improved efficiency and generic constructions
Reviewers for conferences:
-
CRYPTO 2015, 2017, 2018, 2021, 2024;
EUROCRYPT 2022;
ASIACRYPT 2016, 2017
-
FOCS 2016, 2019
-
TCC 2015, 2016, 2017;
PKC 2018, 2019, 2024
-
CCS 2021