Highlights

Microsoft unveils Majorana 1, the world’s first quantum processor powered by topological qubits

微软发布世界首款拓扑量子处理器 Majorana 1，迈向实用量子计算新里程碑。

• https://azure.microsoft.com/en-us/blog/quantum/2025/02/19/microsoft-unveils-majorana-1-the-worlds-first-quantum-processor-powered-by-topological-qubits/

After 20 Years, Math Couple Solves Major Group Theory Problem

数学家夫妇历时 20 年证明 McKay 猜想，解开群论核心难题，推动数学对称性研究新突破。

• https://www.quantamagazine.org/after-20-years-math-couple-solves-major-group-theory-problem-20250219/

The road to Post-Quantum Ethereum transaction is paved with Account Abstraction (AA)

以账户抽象 (AA) 整合 Falcon 签名，推动以太坊迈向抗量子未来，但仍需解决 ECDSA 依赖问题。

• https://ethresear.ch/t/the-road-to-post-quantum-ethereum-transaction-is-paved-with-account-abstraction-aa/21783

NTT as PostQuantum and Starks settlements helper precompile

提议用 NTT 预编译优化以太坊抗量子技术，为 Falcon、Dilithium 和 STARKs 协议显著降低 Gas 成本。

• https://ethresear.ch/t/ntt-as-postquantum-and-starks-settlements-helper-precompile/21775

Latticefold and lattice-based operations performance report

Latticefold 优化报告展示格操作性能提升，采用 Goldilocks 环配置实现高效 NTT 乘法，适配安全与性能需求。

• https://nethermind.notion.site/Latticefold-and-lattice-based-operations-performance-report-153360fc38d080ac930cdeeffed69559

Introducing bugs.zksecurity.xyz a knowledge base for ZK bugs

zksecurity 推出 zkBugs 知识库，记录和分析零知识电路漏洞，促进开发者和研究者的安全改进协作。

• https://www.zksecurity.xyz/blog/posts/zkbugs-website/
• https://bugs.zksecurity.xyz/

Introduction to Programmable Cryptography Workbook

这是 0xPARC 的《可编程密码学入门》工作簿，其主要目标是帮助读者理解书中的内容和概念。Jupyter Notebooks 直接将书中提到的算法和示例转化为代码，并以最直观的方式编写（即，不进行任何优化）。

• https://github.com/flyingnobita/0xparc_intro_book_workbook
  
  

Updates

AIR-ICICLE : Plonky3 on ICICLE, (part 1)

• https://medium.com/@ingonyama/air-icicle-plonky3-on-icicle-part-1-2110d9e86ef9

ICICLE V3.5: Sumcheck with Lambda Functions

• https://medium.com/@ingonyama/icicle-v3-5-sumcheck-with-lambda-functions-5f17d88910cb
  
  

Papers

“Check-Before-you-Solve”: Verifiable Time-lock Puzzles

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

Merkle Mountain Ranges are Optimal: On witness update frequency for cryptographic accumulators

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

Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC

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

Diamond iO: A Straightforward Construction of Indistinguishability Obfuscation from Lattices

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

On the Power of Polynomial Preprocessing: Proving Computations in Sublinear Time, and More

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

Robust Non-Interactive Zero-Knowledge Combiners

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

LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems

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

The Round Complexity of Black-Box Post-Quantum Secure Computation

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

Verifiable Streaming Computation and Step-by-Step Zero-Knowledge

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

TFHE Gets Real: an Efficient and Flexible Homomorphic Floating-Point Arithmetic

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

Error-Simulatable Sanitization for TFHE and Applications

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

Transistor: a TFHE-friendly Stream Cipher

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

Improved Resultant Attack against Arithmetization-Oriented Primitives

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

HasteBoots: Proving FHE Bootstrapping in Seconds

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

Transparent SNARKs over Galois Rings

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

Dazzle: Improved Adaptive Threshold Signatures from DDH

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

Context-Dependent Threshold Decryption and its Applications

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

Verifiable Computation for Approximate Homomorphic Encryption Schemes

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

How to Securely Implement Cryptography in Deep Neural Networks

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

Dynamic Decentralized Functional Encryption: Generic Constructions with Strong Security

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

Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments

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

DFS: Delegation-friendly zkSNARK and Private Delegation of Provers

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

Practical Zero-Trust Threshold Signatures in Large-Scale Dynamic Asynchronous Networks

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

FHE-SNARK vs. SNARK-FHE: From Analysis to Practical Verifiable Computation

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

Lattice-based Cryptography: A survey on the security of the lattice-based NIST finalists

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

Dimensional eROSion: Improving the ROS Attack with Decomposition in Higher Bases

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

Quasi-Linear Indistinguishability Obfuscation via Mathematical Proofs of Equivalence and Applications

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

Non-Interactive Key Exchange: New Notions, New Constructions, and Forward Security

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

Malleable SNARKs and Their Applications

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

Traceable Verifiable Random Functions

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

Lattice-based Sigma-Protocols for Polynomial Relations with Standard Soundness

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

Zinc: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers

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

Traceable Verifiable Secret Sharing and Applications

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