Ye Zhang

@ZhangYe46023266

Cryptography & Secure System & Hardware System. Especially interested in practical and efficient zero-knowledge proof system. Apply for Ph.D. in 2020!

Peking University
Vrijeme pridruživanja: studeni 2018.
Rođen/a 1. siječnja 1999.

Tweetovi

Blokirali ste korisnika/cu @ZhangYe46023266

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @ZhangYe46023266

  1. proslijedio/la je Tweet
    28. sij

    [New] Efficient polynomial commitment schemes for multiple points and polynomials (Justin Drake and Ariel Gabizon)

    Poništi
  2. 17. sij
    Poništi
  3. proslijedio/la je Tweet
    16. pro 2019.

    A good optimization in the reduction from R1CS to the LinCheck+RowCheck language (i.e., Marlin-language: As you process constraints, keep track of the # of nonzero entries in the A, B matrices and swap the a, b terms in each new constraint to keep them as balanced as possible.

    Prikaži ovu nit
    Poništi
  4. proslijedio/la je Tweet
    24. pro 2019.

    Happy to share that our paper Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof () was accepted by IEEE S&P 2020 ! We propose a new transparent zero knowledge proof scheme with very fast prover time.

    Poništi
  5. proslijedio/la je Tweet
    21. pro 2019.

    's grad student placement is AMAZING! The department placed 15 faculty members (may be more) in top universities in 2019, incl. MIT, CMU, Cornell, Georgia Tech, and my UCSD (go Triton!) 2020 will be another great year! We have SO MANY strong students on the market!

    Poništi
  6. 18. pro 2019.
    Prikaži ovu nit
    Poništi
  7. 18. pro 2019.

    Last day at UIUC. So lucky to spend 6 months' wonderful time doing research on zkp with so many excellent guys~ – mjesto: Coordinated Science Laboratory (CSL)

    Prikaži ovu nit
    Poništi
  8. proslijedio/la je Tweet
    8. pro 2019.

    Recently recursive SNARK proofs have attracted a lot of attention in the crypto community, being used in projects as diverse as and by us at . How do they work? I wrote an explanation here:

    Prikaži ovu nit
    Poništi
  9. proslijedio/la je Tweet
    4. pro 2019.

    SoK: Computer-Aided Cryptography: M Barbosa, G Barthe, K Bhargavan, B Blanchet, C Cremers, K Liao, B Parno

    Poništi
  10. proslijedio/la je Tweet
    25. stu 2019.

    Thank you to everyone who joined us for our IC3 Fall Retreat and to and the rest of the team who hosted us!

    Poništi
  11. 3. stu 2019.

    But I have to say the English translation is terrible without many many details expressed in Chinese and can't express the exact feeling in the video at all.

    Prikaži ovu nit
    Poništi
  12. 3. stu 2019.

    Very impressive song by a child via

    Prikaži ovu nit
    Poništi
  13. proslijedio/la je Tweet
    31. lis 2019.

    Two new prizes also announced, ending Jan 30. #1 - $5,000 for fastest alternative algorithm implementation on FPGA #2 - $5,000 for best research paper exploring low latency RSA VDF algorithms Official rules here:

    Prikaži ovu nit
    Poništi
  14. proslijedio/la je Tweet

    Finally online: achieving polylog verification for IOPs (⇒ SNARKs) *without* preprocessing via succinct R1CS. We've taken to calling it "Succinct Aurora", but one could also call it "R1CS-STARK". With , Alessandro Chiesa, Lior Goldberg, and

    Prikaži ovu nit
    Poništi
  15. proslijedio/la je Tweet
    25. lis 2019.

    how to hide your Bitcoins

    Poništi
  16. proslijedio/la je Tweet
    26. lis 2019.

    presenting Halo at the Zero Knowledge Summit while rockin Zcash sneakers

    Poništi
  17. proslijedio/la je Tweet
    21. lis 2019.

    New paper with and : Supersonic a true SNARK (<8KB, ~75ms verif.) without trusted setup. It uses a new polynomial commitment in groups of unknown order called DARK. We can compile polynomial IOPs such as Sonic/Marlin/Plonk to SNARKs

    Poništi
  18. proslijedio/la je Tweet

    Illinois is *literally overflowing* with blockchain-relevant courses, inc: - Consensus protocols - Graduate cryptography - Undergraduate cryptography - a blockchain course postponed till spring to make room

    Prikaži ovu nit
    Poništi
  19. proslijedio/la je Tweet
    13. kol 2019.

    In January, CSL's Andrew Miller received an email out of the blue from a 17-year-old in Mumbai, India. That communication led to Aman Ladia spending the summer at CSL! While here, Aman developed a new cryptocurrency protocol as a HIGH. SCHOOL. SENIOR!

    Poništi
  20. proslijedio/la je Tweet
    23. srp 2019.

    An overview of the Foundation's FPGA acceleration project, which we announced this morning! Engineer Ben Devlin wrote a detailed architecture document: Not sure what we're talking about? Read the announcement 🤓

    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·