Ϲhristian Knabenhans

43 posts

Ϲhristian Knabenhans

Ϲhristian Knabenhans

@cknabs

PhD student @EPFL; ex-@ETH. Taking privacy-enhancing crypto (SNARKs, FHE & co) from theory to practice, and back. https://t.co/GbgoBtq3h4 🇨🇭🇫🇷 🏳️‍🌈

🇨🇭(Lausanne ⇆ Zurich) Katılım Haziran 2021
419 Takip Edilen294 Takipçiler
Ϲhristian Knabenhans
Ϲhristian Knabenhans@cknabs·
Finally, we're thinking about high-assurance. We're working on a formally verified constant-time implementation of client-side FHE operations (in Jasmin+EasyCrypt), and we're exploring how to best use high-assurance tools (hax/hacspec, Jasmin, Lean) for lattirust. Stay tuned!
English
0
0
7
457
Ϲhristian Knabenhans
Ϲhristian Knabenhans@cknabs·
At the moment we're relying on existing lattice estimators to set concrete parameters, but Xavier Marchon did a semester project to write a SIS-specific, Rust lattice estimator, which will be directly integrated in lattirust.
English
1
0
3
532
Ϲhristian Knabenhans
Ϲhristian Knabenhans@cknabs·
I'm happy to finally open-source lattirust, a library for lattice-based zero-knowledge/succinct arguments! Lattirust is somewhat like arkworks, but for lattices; and like lattigo, but for arguments. ➔ github.com/lattirust
English
1
29
167
10.7K
Ϲhristian Knabenhans
Ϲhristian Knabenhans@cknabs·
Finally, an open problem: Lova is very algebraic but uses plain SIS, Latticefold uses MSIS but relies on sumcheck, which is a powerful tool (too powerful?). Can we get a scheme that uses MSIS and barely does more than a single random linear combination? (7/8)
English
1
0
3
476
Ϲhristian Knabenhans
Ϲhristian Knabenhans@cknabs·
If you're applying for a PhD in applied crypto/system security/privacy this year, you should absolutely consider applying to @anwarhit's new lab at UoT! She's a brilliant researcher and a wonderful advisor, don't miss this opportunity to work with her.
English
0
0
9
684
Ϲhristian Knabenhans retweetledi
Tom Gur
Tom Gur@TomGur·
Excited to share this new paper with Jack O'Connor and @_nickspoon! We improve our ZK-PCP construction to cover all of NEXP (with exponential proofs), scale it to NP with polynomial proofs, and obtain O(1)-locality via composition--yielding a ZK analogue of the PCP theorem. 1/3
Tom Gur tweet media
English
1
31
160
22.6K
Ϲhristian Knabenhans retweetledi
Trail of Bits
Trail of Bits@trailofbits·
Is there a quantum computer in the NSA's basement? Does there need to be to justify PQC? Read the blog: buff.ly/3zqqQvI
Trail of Bits tweet media
English
1
17
45
12.7K