Meta tags:
Headings (most frequently used words):
binyi, chen, about, me, research, highlights, publications, talks, teaching, service, personal, menu, contact, folding, accumulation, schemes, hash, based, snarks, memory, hard, functions, stanford, university, program, committee, reviewer,
Text of the page (most frequently used words):
link (34), binyi (23), the (23), 2024 (23), chen (23), and (21), 2025 (20), folding (17), for (17), crypto (16), based (13), with (12), from (12), #university (11), eurocrypt (9), proof (9), lattice (9), scheme (9), slides (8), seminar (8), 2023 (8), that (8), 2016 (7), asiacrypt (7), efficient (7), stanford (6), research (6), proofs (6), 2019 (6), 2017 (6), scrypt (6), memory (6), high (6), schemes (6), latticefold (6), snarks (6), dan (6), boneh (6), succinct (5), generic (5), random (5), oracle (5), model (5), hard (5), linear (5), prover (5), degree (5), apr (5), systems (5), stefano (5), tessaro (5), post (4), blockchain (4), tcc (4), parallel (4), space (4), custom (4), gates (4), privacy (4), polynomial (4), commitment (4), codes (4), may (4), scalable (4), fields (4), quantum (3), zero (3), knowledge (3), conference (3), sbc (3), 2018 (3), 2015 (3), 2022 (3), efficiency (3), best (3), paper (3), award (3), california (3), study (3), club (3), new (3), hyperplonk (3), time (3), scaling (3), explorations (3), ethereum (3), foundation (3), bay (3), area (3), day (3), protostar (3), accumulation (3), special (3), sound (3), protocols (3), basefold (3), zksummit (3), size (3), wang (3), ben (3), fisch (3), benedikt (3), bünz (3), zhang (3), computation (3), framework (3), blaze (3), snark (3), supports (3), prof (3), design (2), personal (2), service (2), teaching (2), talks (2), publications (2), about (2), are (2), science (2), 2021 (2), 2026 (2), oblivious (2), ram (2), improved (2), constructions (2), complexity (2), maximally (2), berkleley (2), workshop (2), plonk (2), supported (2), feb (2), field (2), agnostic (2), foldable (2), security (2), jun (2), aug (2), nov (2), dec (2), its (2), applications (2), veritas (2), verifying (2), image (2), transformations (2), scale (2), faster (2), simpler (2), shorter (2), arity (2), pairing (2), batch (2), arguments (2), crs (2), 2013 (2), hao (2), tie (2), yan (2), liu (2), tao (2), qin (2), huijia (2), lin (2), joël (2), alwen (2), krzysztof (2), pietrzak (2), functions (2), non (2), zhenfei (2), hadas (2), zeilberger (2), trisha (2), datta (2), espresso (2), symphony (2), password (2), hash (2), highly (2), optimal (2), system (2), large (2), statements (2), implementations (2), multilinear (2), over (2), binary (2), polylogarithmic (2), verifier (2), instances (2), can (2), blog (2), implementation (2), any (2), leads (2), advised (2), html5, charles_chen533, edu, contact, homepage, menu, cryptography, technology, enjoy, unwinding, nature, here, some, places, explored, ccs, pkc, stoc, focs, reviewer, zkproof, program, committee, designer, instructor, 355, applied, website, talk, affiliated, cesc, york, reading, group, jan, ntt, cis, northwestern, austin, cmu, cylab, ucsd, theory, visa, sumcheck, builders, seminars, simons, jul, introduction, ijcai, collaborative, topic, regression, social, regularization, tag, recommendation, arxiv, anonymous, signaling, aamas, mechanism, daily, deals, vladimir, kolmogorov, chethan, kamath, leonid, reyzin, cryptographic, primitives, pratyay, mukherjee, kristina, hostakova, yilei, continuous, bounded, malleable, stronger, alex, xiong, fernando, krell, philippe, camacho, usenix, verizexe, decentralized, private, universal, setup, mengke, tianle, fatemehsadat, mireshghallah, yulia, tsvetkov, naacl, tianxing, latticegen, cooperative, which, hides, generated, text, aware, generation, cloud, nirvan, tyagi, wilson, nguyen, mangrove, sequencing, network, hotshot, consensus, tiramisu, data, availability, builder, exchange, ron, rothblum, nicolas, resch, martijn, brehm, fast, interleaved, raa, david, noel, elias, submission, authors, listed, alphabetical, order, last, name, unless, asterisk, indicated, popular, function, formally, prove, informally, speaking, attacker, cannot, break, hashing, even, equipped, parallelized, optimized, hardwares, asics, result, won, optimally, hardness, specifically, designed, proving, complex, zkevms, enabling, ulvetanna, binius, adapted, version, espressosys, strictly, speed, similar, fastest, literature, such, brakedown, while, achieving, 10x, smaller, verification, instantiated, almost, this, enables, more, flexible, options, selecting, instantiations, variant, lambdaclass, concept, relations, proved, via, uniform, table, lookups, geometry, ivc, secure, naturally, recursive, estimated, performance, competitive, top, pre, nethermind, pcds, kst21, bclms20, turns, into, along, way, develop, thousands, once, near, first, highlights, interests, github, twitter, linkedin, google, scholar, completed, spent, year, visiting, student, received, bachelor, 2014, shanghai, jiaotong, acm, honors, class, washington, rachel, santa, barbara, postdoc, researcher, previously, was, chief, cryptographer,
Text of the page (random words):
binyi chen binyi chen about me i m a postdoc researcher at stanford university advised by prof dan boneh previously i was the chief cryptographer at espresso systems i completed my ph d in 2019 from university of california santa barbara advised by prof stefano tessaro and prof huijia rachel lin i spent the year 2018 2019 as a visiting ph d student at university of washington i received my bachelor degree in 2014 from shanghai jiaotong university acm honors class google scholar linkedin twitter github research interests post quantum cryptography zero knowledge and succinct proofs blockchain technology research highlights folding accumulation schemes symphony the first framework that turns a folding scheme into a scalable snark system in the random oracle model along the way we develop a new lattice based folding scheme that supports folding thousands of instances at once with near optimal prover efficiency latticefold latticefold new lattice based folding schemes bclms20 kst21 for np statements that is post quantum secure and naturally leads to efficient recursive snarks and pcds the estimated performance is competitive with the top pre quantum folding schemes implementation nethermind protostar a generic and highly efficient folding scheme for any relations that can be proved via special sound protocols it leads to an efficient ivc scheme for non uniform computation that supports high degree custom gates and table lookups blog post and implementations from geometry research hash based snarks basefold a multilinear polynomial commitment scheme with polylogarithmic verifier and proof size that can be instantiated over almost any fields this enables more flexible options for selecting fields for snark instantiations proof of concept implementation blog post from lambdaclass a variant that supports binary fields blaze a multilinear polynomial commitment over binary fields with strictly linear time prover and polylogarithmic verifier for large computation instances blaze s prover speed is similar to the fastest snark in the literature such as brakedown while achieving 10x smaller proof verification hyperplonk a proof system specifically designed for proving large complex statements e g zkevms by enabling high degree custom gates implementations espressosys ethereum foundation and an adapted version from ulvetanna based on binius memory hard functions optimal memory hardness of scrypt scrypt is a popular password hash function we formally prove that it is optimally memory hard informally speaking the attacker cannot break the password hashing scheme even if it is equipped with highly parallelized and optimized hardwares e g asics the result won the best paper award at eurocrypt 2017 publications authors are listed in alphabetical order by last name unless an asterisk is indicated symphony scalable snarks in the random oracle model from lattice based high arity folding link binyi chen in submission pairing based batch arguments for np with a linear size crs link binyi chen noel elias david j wu asiacrypt 2025 latticefold a lattice based folding scheme and its applications to succinct proof systems link dan boneh binyi chen asiacrypt 2025 sbc 2024 latticefold faster simpler shorter lattice based folding for succinct proof systems link dan boneh binyi chen crypto 2025 zksummit 13 blaze fast snarks from interleaved raa codes link martijn brehm binyi chen ben fisch nicolas resch ron d rothblum hadas zeilberger eurocrypt 2025 zksummit 13 veritas verifying image transformations at scale link trisha datta binyi chen dan boneh s p 2025 the espresso sequencing network hotshot consensus tiramisu data availability and builder exchange link sbc 2024 mangrove a scalable framework for folding based snarks link wilson nguyen trisha datta binyi chen nirvan tyagi dan boneh crypto 2024 basefold efficient field agnostic polynomial commitment schemes from foldable codes link hadas zeilberger binyi chen ben fisch crypto 2024 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 talks pairing based batch arguments for np with a linear size crs slides at asiacrypt 2025 dec 2025 link scalable snarks in the random oracle model from high arity folding slides at bay area crypto day nov 2025 link an introduction to lattice based folding schemes at simons proofs workshop jul 2025 link latticefold faster simpler shorter lattice based folding for succinct proof systems at crypto 2025 aug 2025 link at zksummit 13 may 2025 link veritas verifying image transformations at scale slides at sumcheck builders seminars apr 2025 link latticefold a lattice based folding scheme and its applications to succinct proof systems at asiacrypt 2025 dec 2025 slides at visa research bay area crypto day nov 2024 at the science of blockchain conference aug 2024 link at zk study club jun 2024 link at ucsd theory seminar may 2024 at cmu cylab crypto seminar may 2024 link at ut austin crypto seminar may 2024 at northwestern university crypto seminar apr 2024 at ntt research cis seminar apr 2024 at stanford university security seminar apr 2024 at privacy scaling explorations apr 2024 basefold efficient field agnostic polynomial commitment schemes from foldable codes slides at university of california berkleley crypto seminar feb 2024 at privacy scaling explorations supported by ethereum foundation feb 2024 link at stanford university crypto reading group jan 2024 protostar generic efficient accumulation folding for special sound protocols slides at bay area crypto day 2023 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 slides 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 slides at eurocrypt best paper award talk 2017 on the complexity of scrypt and proofs of space in the parallel random oracle model at eurocrypt 2016 oblivious parallel ram improved efficiency and generic constructions at tcc 2016 a teaching stanford university co designer and instructor cs 355 applied zero knowledge proofs website service program committee eurocrypt 2025 2026 asiacrypt 2025 tcc 2026 zkproof 8 reviewer crypto 2015 2017 2018 2021 2024 2025 eurocrypt 2022 asiacrypt 2016 2017 2024 focs 2016 2019 stoc 2025 tcc 2015 2016 2017 2024 2025 pkc 2018 2019 2024 ccs 2021 the science of blockchain conference sbc 2024 personal i enjoy unwinding in nature here are some of the places i ve explored menu homepage about me research publications talks teaching service personal contact binyi cs stanford edu charles_chen533 design html5 up
|
