Demo Data from SIGIR 2026 / reviewers in the wild / expert
Binyi Chen
dblp:133/2004
· DBLP profile ↗
15ranked-venue papers
4as first author
10since 2021 · last 2025
0000-0003-0835-9678ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 14 · 4 first-author · 10 since 2021Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
14 papers |
Cryptographic protocols and secure computation · 70% Cryptographic primitives and cryptanalysis · 29% Digital forensics and information hiding · 2% | |
| Theoretical computer science
2 papers |
Coding theory · 91% Computational complexity · 9% |
Topics — the 21 heaviest of 24, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
succinct arguments |
2.6 | 3 | 2025 | LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems · CRYPTO (7) 2025 Pairing-Based Batch Arguments for NP with a Linear-Size CRS · ASIACRYPT (5) 2025 LatticeFold: A Lattice-Based Folding Scheme and Its Applications to Succinct Proof Systems · ASIACRYPT (3) 2025 |
Cryptographic protocols and secure computation › proof systems
succinct non-interactive arguments of knowledge |
1.6 | 2 | 2025 | Blaze: Fast SNARKs from Interleaved RAA Codes · EUROCRYPT (4) 2025 Mangrove: A Scalable Framework for Folding-Based SNARKs · CRYPTO (10) 2024 |
Cryptographic protocols and secure computation › proof systems
folding scheme |
1.5 | 2 | 2025 | LatticeFold: A Lattice-Based Folding Scheme and Its Applications to Succinct Proof Systems · ASIACRYPT (3) 2025 Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols · ASIACRYPT (2) 2023 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
1.5 | 2 | 2025 | VerITAS: Verifying Image Transformations at Scale · SP 2025 VeriZexe: Decentralized Private Computation with Universal Setup · USENIX Security Symposium 2023 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › non-interactive zero-knowledge proofs
zk-SNARK |
1.5 | 2 | 2025 | VerITAS: Verifying Image Transformations at Scale · SP 2025 HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates · EUROCRYPT (2) 2023 |
Cryptographic protocols and secure computation
proof systems |
1.3 | 2 | 2023 | HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates · EUROCRYPT (2) 2023 Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols · ASIACRYPT (2) 2023 |
Cryptographic primitives and cryptanalysis › hash functions
memory-hard functions |
0.9 | 3 | 2019 | Memory-Hard Functions from Cryptographic Primitives · CRYPTO (2) 2019 Scrypt Is Maximally Memory-Hard · EUROCRYPT (3) 2017 On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model · EUROCRYPT (2) 2016 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › succinct arguments
batch arguments |
0.9 | 1 | 2025 | Pairing-Based Batch Arguments for NP with a Linear-Size CRS · ASIACRYPT (5) 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.9 | 1 | 2025 | VerITAS: Verifying Image Transformations at Scale · SP 2025 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
0.9 | 1 | 2025 | LatticeFold: A Lattice-Based Folding Scheme and Its Applications to Succinct Proof Systems · ASIACRYPT (3) 2025 |
Cryptographic primitives and cryptanalysis
pairing-based cryptography |
0.9 | 1 | 2025 | Pairing-Based Batch Arguments for NP with a Linear-Size CRS · ASIACRYPT (5) 2025 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
polynomial commitment |
0.8 | 1 | 2024 | BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes · CRYPTO (10) 2024 |
Cryptographic protocols and secure computation
secure distributed computation |
0.7 | 1 | 2023 | VeriZexe: Decentralized Private Computation with Universal Setup · USENIX Security Symposium 2023 |
Cryptographic protocols and secure computation › proof systems
special-sound protocol |
0.7 | 1 | 2023 | Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols · ASIACRYPT (2) 2023 |
Cryptographic primitives and cryptanalysis › provable security › security notions › non-malleability
non-malleable codes |
0.4 | 1 | 2019 | Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space · CRYPTO (1) 2019 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.3 | 1 | 2025 | LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems · CRYPTO (7) 2025 |
Recommender systems › collaborative filtering › matrix factorization
collaborative topic regression |
0.2 | 1 | 2013 | Collaborative Topic Regression with Social Regularization for Tag Recommendation · IJCAI 2013 |
Recommender systems
tag recommendation |
0.2 | 1 | 2013 | Collaborative Topic Regression with Social Regularization for Tag Recommendation · IJCAI 2013 |
Cryptographic primitives and cryptanalysis › cryptographic proofs
proofs of space |
0.1 | 1 | 2019 | Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space · CRYPTO (1) 2019 |
Recommender systems
social recommendation |
0.0 | 1 | 2013 | Collaborative Topic Regression with Social Regularization for Tag Recommendation · IJCAI 2013 |
Recommender systems
social regularization |
0.0 | 1 | 2013 | Collaborative Topic Regression with Social Regularization for Tag Recommendation · IJCAI 2013 |
Methods — techniques the papers use, named apart from their topics
folding · 2.4zk-SNARK · 0.9polynomial commitment · 0.9pairings · 0.9lattice folding · 0.9digital signature · 0.9common reference string · 0.9complexity analysis · 0.8universal setup · 0.7decentralized private computation · 0.7social regularization · 0.2collaborative topic regression · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | LatticeFold: A Lattice-Based Folding Scheme and Its Applications to Succinct Proof Systems
Dan Boneh, Binyi Chen |
ASIACRYPT (3) | 2 |
| 2025 | Pairing-Based Batch Arguments for NP with a Linear-Size CRS
Binyi Chen, Noel Elias, David J. Wu 0001 |
ASIACRYPT (5) | 1 |
| 2025 | LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
Dan Boneh, Binyi Chen |
CRYPTO (7) | 2 |
| 2025 | Blaze: Fast SNARKs from Interleaved RAA Codes
Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron Rothblum, Hadas Zeilberger |
EUROCRYPT (4) | 2 |
| 2025 | VerITAS: Verifying Image Transformations at ScaleabstractVerifying image provenance has become an important topic, especially in the realm of news media. To address this issue, the Coalition for Content Provenance and Authenticity (C2PA) developed a standard to verify image provenance that relies on digital signatures produced by cameras. However, photos are usually edited before being published, and a signature on an original photo cannot be verified given only the published edited image. In this work, we describe VerITAS, a system that uses zero-knowledge proofs (zk-SNARKs) to prove that only certain edits have been applied to a signed photo. While past work has created image editing proofs for photos, VerITAS is the first to do so for realistically large images (30 megapixels). Our key innovation enabling this leap is the design of a new proof system that enables proving knowledge of a valid signature on a large amount of witness data. We run experiments on realistically large images that are more than an order of magnitude larger than those tested in prior work. In the case of a computationally weak signer, such as a camera, we are able to generate a proof of valid edits for a 90 MB image in just over thirteen minutes, costing about $0.54 on AWS per image. In the case of a more powerful signer, we are able to generate a proof of valid edits for a 90 MB image in just over three minutes, costing only $0.13 on AWS per image. Either way, proof verification time is less than a second. Our techniques apply broadly whenever there is a need to prove that an efficient transformation was applied correctly to a large amount of signed private data. Trisha Datta, Binyi Chen, Dan Boneh |
SP | 2 |
| 2024 | Mangrove: A Scalable Framework for Folding-Based SNARKs
Wilson Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi, Dan Boneh |
CRYPTO (10) | 3 |
| 2024 | BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes
Hadas Zeilberger, Binyi Chen, Ben Fisch |
CRYPTO (10) | 2 |
| 2023 | Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols
Benedikt Bünz, Binyi Chen |
ASIACRYPT (2) | 2 |
| 2023 | HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates
Binyi Chen, Benedikt Bünz, Dan Boneh, Zhenfei Zhang |
EUROCRYPT (2) | 1 |
| 2023 | VeriZexe: Decentralized Private Computation with Universal Setup
Alex Luoyuan Xiong, Binyi Chen, Zhenfei Zhang, Benedikt Bünz, Ben Fisch, Fernando Krell, Philippe Camacho |
USENIX Security Symposium | 2 |
| 2019 | Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space
Binyi Chen, Yilei Chen 0001, Kristina Hostáková, Pratyay Mukherjee |
CRYPTO (1) | 1 |
| 2019 | Memory-Hard Functions from Cryptographic Primitives
Binyi Chen, Stefano Tessaro |
CRYPTO (2) | 1 |
| 2017 | Scrypt Is Maximally Memory-Hard
Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro |
EUROCRYPT (3) | 2 |
| 2016 | On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro |
EUROCRYPT (2) | 2 |
| 2013 | Collaborative Topic Regression with Social Regularization for Tag Recommendation
Hao Wang 0014, Binyi Chen, Wu-Jun Li |
IJCAI | 2 |