Binyi Chen

Orcid: 0000-0003-0835-9678

According to our database1, Binyi Chen authored at least 21 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Mangrove: A Scalable Framework for Folding-based SNARKs.
IACR Cryptol. ePrint Arch., 2024

VerITAS: Verifying Image Transformations at Scale.
IACR Cryptol. ePrint Arch., 2024

Blaze: Fast SNARKs from Interleaved RAA Codes.
IACR Cryptol. ePrint Arch., 2024

LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems.
IACR Cryptol. ePrint Arch., 2024

The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange.
IACR Cryptol. ePrint Arch., 2024

LatticeGen: Hiding Generated Text in a Lattice for Privacy-Aware Large Language Model Generation on Cloud.
Proceedings of the Findings of the Association for Computational Linguistics: NAACL 2024, 2024

2023
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes.
IACR Cryptol. ePrint Arch., 2023

ProtoStar: Generic Efficient Accumulation/Folding for Special Sound Protocols.
IACR Cryptol. ePrint Arch., 2023

LatticeGen: A Cooperative Framework which Hides Generated Text in a Lattice for Privacy-Aware Generation on Cloud.
CoRR, 2023

VeriZexe: Decentralized Private Computation with Universal Setup.
Proceedings of the 32nd USENIX Security Symposium, 2023

2022
VERI-ZEXE: Decentralized Private Computation with Universal Setup.
IACR Cryptol. ePrint Arch., 2022

HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates.
IACR Cryptol. ePrint Arch., 2022

2019
Memory-Hard Functions: When Theory Meets Practice.
PhD thesis, 2019

Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space.
IACR Cryptol. ePrint Arch., 2019

Memory-Hard Functions from Cryptographic Primitives.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2016
Scrypt is Maximally Memory-Hard.
IACR Cryptol. ePrint Arch., 2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
IACR Cryptol. ePrint Arch., 2016

2015
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions.
IACR Cryptol. ePrint Arch., 2015

Mechanism Design for Daily Deals.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2013
$K$-anonymous Signaling Scheme.
CoRR, 2013

Collaborative Topic Regression with Social Regularization for Tag Recommendation.
Proceedings of the IJCAI 2013, 2013


  Loading...