Highlights

The High Cost of Quantum Randomness Is Dropping

随机性对于某些研究至关重要，但实现起来却非常复杂。现在，我们可以用“伪随机性”来代替。

• https://www.quantamagazine.org/the-high-cost-of-quantum-randomness-is-dropping-20250328/

How a Problem About Pigeons Powers Complexity Theory

鸽巢原理的新变体推动复杂性理论与问题分类的突破性进展。

• https://www.quantamagazine.org/how-a-problem-about-pigeons-powers-complexity-theory-20250404/

When Will This End?

在线团队合作探究程序何时终止以及是否终止的问题。

• https://cacm.acm.org/news/when-will-this-end/

What Is the True Promise of Quantum Computing?

Ewin Tang 展示经典算法可匹敌量子算法，颠覆预期，揭示量子计算的真正潜力仍充满不确定与希望。

• https://www.quantamagazine.org/what-is-the-true-promise-of-quantum-computing-20250403/

Updates

Introducing SP1-2FA: Adding a Second Layer of Security to zkVMs with TEEs

• https://blog.succinct.xyz/sp1-2fa/

Papers

Zinnia: An Expressive and Efficient Tensor-Oriented Zero-Knowledge Programming Framework

• https://eprint.iacr.org/2025/572

Forking Lemma in EasyCrypt

• https://eprint.iacr.org/2025/573

Wagner's Algorithm Provably Runs in Subexponential Time for SIS

• https://eprint.iacr.org/2025/575

Pre-Constructed Publicly Verifiable Secret Sharing and Applications

• https://eprint.iacr.org/2025/576

Efficient Revocable Identity-Based Encryption from Middle-Product LWE

• https://eprint.iacr.org/2025/580

Reusable Dynamic Multi-Party Homomorphic Encryption

• https://eprint.iacr.org/2025/581

Release the Power of Rejected Signatures: An Efficient Side-Channel Attack on Dilithium

• https://eprint.iacr.org/2025/582

Counter Galois Onion (CGO) for Tor: Fast Non-Malleable Onion Encryption

• https://eprint.iacr.org/2025/583

ColliderVM: Stateful Computation on Bitcoin

• https://eprint.iacr.org/2025/591

Efficient SNARKs for Boolean Circuits via Sumcheck over Tower Fields

• https://eprint.iacr.org/2025/594

Improved Round-by-round Soundness IOPs via Reed-Muller Codes

• https://eprint.iacr.org/2025/600