Wilson Nguyen
@mercysjest
Followers
890
Following
931
Media
2
Statuses
416
@Stanford CS PhD candidate - Applied Cryptography Group
Joined December 2021
RT @mmaker: We updated our paper on Fiat-Shamir!. We now take a closer look at the gap between what symmetric cryptography has focused on f….
eprint.iacr.org
We analyze a variant of the Fiat–Shamir transformation based on an ideal permutation. The transformation relies on the popular duplex sponge paradigm, and minimizes the number of calls to the...
0
26
0
RT @ronrothblum: New work with the wonderful Noga and Noor continuing the line of work on efficient proofs for Boolean circuits. We reduce….
eprint.iacr.org
Interactive Oracle Proofs (IOPs) form the backbone of some of the most efficient general-purpose cryptographic proof-systems. In an IOP, the prover can interact with the verifier over multiple...
0
13
0
RT @billatnapier: ECC saved the security of the Internet, and where we moved from the DH method with discrete logs to an EC version. Satosh….
0
2
0
RT @QuangVDao: My latest paper on optimizing the sum-check protocol is out! Joint work with @SuccinctJT and Ingony….
eprint.iacr.org
At the core of the fastest known SNARKs is the sum-check protocol. In this paper, we describe two complementary optimizations that significantly accelerate sum-check proving in key applications. The...
0
33
0
RT @alinush407: So, if you are at SBC in August (, come hear about it from @TrishaCDatta's and @nazirkamilla's talk….
0
2
0
RT @zeroknowledgefm: Catch Jessica Chen's talk from last month's zkSummit! Her work introduces a 3-round sumcheck protocol that achieves al….
0
2
0
RT @kleptographic: WARP feels like the natural conclusion to the hash-based accumulation schemes I've been working on since the start of my….
0
2
0
RT @GiacomoFenzi: 🪄✨ And for our next trick, choose a code, any code!.Introducing WARP 🌀, the first linear-time accumulation scheme. Brough….
0
23
0
RT @daryakaviani: Thrilled to share our @IEEESSP '25 work "Myco 🌳🍄: Unlocking Polylogarithmic Accesses in Metadata-Private Messaging" with….
eprint.iacr.org
As billions of people rely on end-to-end encrypted messaging, the exposure of metadata, such as communication timing and participant relationships, continues to deanonymize users. Asynchronous...
0
13
0
RT @IACR_News: #award The 2025 IACR Test-of-Time Award for Eurocrypt goes to: "On Ideal Lattices and Learning with Errors over Rings", by V….
0
36
0
RT @AndrijaNovakov6: 1/9 Happy to open-source joint work with @GuilleAngeris—.CryptoUtilities.jl, a set of Julia packages that brings fast….
0
16
0
RT @srinathtv: Recently summarized how NeutronNova improves on prior work—thought it’d be useful to share it. Whether you're working on re….
0
17
0
RT @Charles_Chen533: Exciting paper by @benediktbuenz and his NYU colleagues that achieves 801× faster Hyperplonk p….
0
17
0
RT @0xAlbertG: Zinc: arguments for integer/rational arithmetic. Presented at zkProof 7 in Sofia. The conference was a blast! .
0
8
0
RT @PrivacyScaling: Join us tomorrow for a dive into zero knowledge proving systems based on vector oblivious linear evaluation (VOLE), pre….
0
4
0
RT @zeroknowledgefm: A few weeks ago, zkStudy Club hosted William Wang presenting ARC: Accumulation for Reed-Solomon Codes. Video is below….
0
3
0