Highlights
The High Cost of Quantum Randomness Is Dropping
Randomness is essential to some research, but it’s always been prohibitively complicated to achieve. Now, we can use “pseudorandomness” instead.
How a Problem About Pigeons Powers Complexity Theory
A twist on the pigeonhole principle inspires new insights in complexity theory and problem classification.
When Will This End?
Online teamwork probes the problem of when, and whether, a program will terminate.
What Is the True Promise of Quantum Computing?
Ewin Tang’s work shows classical algorithms can rival quantum ones, challenging assumptions and revealing the nuanced promise of quantum computing.
Updates
Introducing SP1-2FA: Adding a Second Layer of Security to zkVMs with TEEs
Papers
Zinnia: An Expressive and Efficient Tensor-Oriented Zero-Knowledge Programming Framework
Forking Lemma in EasyCrypt
Wagner's Algorithm Provably Runs in Subexponential Time for SIS
Pre-Constructed Publicly Verifiable Secret Sharing and Applications
Efficient Revocable Identity-Based Encryption from Middle-Product LWE
Reusable Dynamic Multi-Party Homomorphic Encryption
Release the Power of Rejected Signatures: An Efficient Side-Channel Attack on Dilithium
Counter Galois Onion (CGO) for Tor: Fast Non-Malleable Onion Encryption
ColliderVM: Stateful Computation on Bitcoin
Efficient SNARKs for Boolean Circuits via Sumcheck over Tower Fields
Improved Round-by-round Soundness IOPs via Reed-Muller Codes
**If you'd like to receive updates via email, subscribe us!