default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBinyi Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Hadas Zeilberger, Binyi Chen, Ben Fisch:
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes. CRYPTO (10) 2024: 138-169- [c12]Wilson D. Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi
, Dan Boneh:
Mangrove: A Scalable Framework for Folding-Based SNARKs. CRYPTO (10) 2024: 308-344 - [c11]Mengke Zhang, Tianxing He, Tianle Wang, Lu Mi, Niloofar Mireshghallah, Binyi Chen, Hao Wang, Yulia Tsvetkov:
LatticeGen: Hiding Generated Text in a Lattice for Privacy-Aware Large Language Model Generation on Cloud. NAACL-HLT (Findings) 2024: 2674-2690 - [i15]Dan Boneh, Binyi Chen:
LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems. IACR Cryptol. ePrint Arch. 2024: 257 (2024) - [i14]Wilson D. Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi, Dan Boneh:
Mangrove: A Scalable Framework for Folding-based SNARKs. IACR Cryptol. ePrint Arch. 2024: 416 (2024) - [i13]Trisha Datta, Binyi Chen, Dan Boneh:
VerITAS: Verifying Image Transformations at Scale. IACR Cryptol. ePrint Arch. 2024: 1066 (2024) - [i12]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:
The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange. IACR Cryptol. ePrint Arch. 2024: 1189 (2024) - [i11]Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger:
Blaze: Fast SNARKs from Interleaved RAA Codes. IACR Cryptol. ePrint Arch. 2024: 1609 (2024) - 2023
- [c10]Benedikt Bünz, Binyi Chen:
Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols. ASIACRYPT (2) 2023: 77-110 - [c9]Binyi Chen, Benedikt Bünz, Dan Boneh, Zhenfei Zhang:
HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates. EUROCRYPT (2) 2023: 499-530 - [c8]Alex Luoyuan Xiong, Binyi Chen, Zhenfei Zhang, Benedikt Bünz, Ben Fisch, Fernando Krell, Philippe Camacho:
VeriZexe: Decentralized Private Computation with Universal Setup. USENIX Security Symposium 2023: 4445-4462 - [i10]Mengke Zhang, Tianxing He, Tianle Wang, Lu Mi, Fatemehsadat Mireshghallah, Binyi Chen, Hao Wang, Yulia Tsvetkov:
LatticeGen: A Cooperative Framework which Hides Generated Text in a Lattice for Privacy-Aware Generation on Cloud. CoRR abs/2309.17157 (2023) - [i9]Benedikt Bünz, Binyi Chen:
ProtoStar: Generic Efficient Accumulation/Folding for Special Sound Protocols. IACR Cryptol. ePrint Arch. 2023: 620 (2023) - [i8]Hadas Zeilberger, Binyi Chen, Ben Fisch:
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes. IACR Cryptol. ePrint Arch. 2023: 1705 (2023) - 2022
- [i7]Alex Luoyuan Xiong, Binyi Chen, Zhenfei Zhang, Benedikt Bünz, Ben Fisch, Fernando Krell, Philippe Camacho:
VERI-ZEXE: Decentralized Private Computation with Universal Setup. IACR Cryptol. ePrint Arch. 2022: 802 (2022) - [i6]Binyi Chen, Benedikt Bünz, Dan Boneh, Zhenfei Zhang:
HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates. IACR Cryptol. ePrint Arch. 2022: 1355 (2022)
2010 – 2019
- 2019
- [b1]Binyi Chen:
Memory-Hard Functions: When Theory Meets Practice. University of California, Santa Barbara, USA, 2019 - [c7]Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee:
Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space. CRYPTO (1) 2019: 467-495 - [c6]Binyi Chen, Stefano Tessaro:
Memory-Hard Functions from Cryptographic Primitives. CRYPTO (2) 2019: 543-572 - [i5]Binyi Chen, Yilei Chen, Kristina Hostáková, Pratyay Mukherjee:
Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space. IACR Cryptol. ePrint Arch. 2019: 552 (2019) - 2017
- [c5]Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro:
Scrypt Is Maximally Memory-Hard. EUROCRYPT (3) 2017: 33-62 - 2016
- [c4]Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro:
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. EUROCRYPT (2) 2016: 358-387 - [c3]Binyi Chen, Huijia Lin, Stefano Tessaro:
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions. TCC (A2) 2016: 205-234 - [i4]Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro:
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. IACR Cryptol. ePrint Arch. 2016: 100 (2016) - [i3]Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro:
Scrypt is Maximally Memory-Hard. IACR Cryptol. ePrint Arch. 2016: 989 (2016) - 2015
- [c2]Binyi Chen, Tao Qin, Tie-Yan Liu:
Mechanism Design for Daily Deals. AAMAS 2015: 327-335 - [i2]Binyi Chen, Huijia Lin, Stefano Tessaro:
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions. IACR Cryptol. ePrint Arch. 2015: 1053 (2015) - 2013
- [c1]Hao Wang, Binyi Chen, Wu-Jun Li:
Collaborative Topic Regression with Social Regularization for Tag Recommendation. IJCAI 2013: 2719-2725 - [i1]Binyi Chen, Tao Qin, Tie-Yan Liu:
$K$-anonymous Signaling Scheme. CoRR abs/1311.6638 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
