Highlights
Microsoft unveils Majorana 1, the world’s first quantum processor powered by topological qubits
微软发布世界首款拓扑量子处理器 Majorana 1，迈向实用量子计算新里程碑。
Microsoft unveils Majorana 1, the first topological quantum processor, advancing practical quantum computing.
After 20 Years, Math Couple Solves Major Group Theory Problem
数学家夫妇历时 20 年证明 McKay 猜想，解开群论核心难题，推动数学对称性研究新突破。
Math couple solves McKay conjecture after 20 years, advancing group theory and symmetry research.
The road to Post-Quantum Ethereum transaction is paved with Account Abstraction (AA)
以账户抽象(AA)整合 Falcon 签名，推动以太坊迈向抗量子未来，但仍需解决 ECDSA 依赖问题。
Leveraging Account Abstraction (AA) with Falcon, Ethereum advances toward a post-quantum future, but ECDSA reliance persists.
NTT as PostQuantum and Starks settlements helper precompile
提议用 NTT 预编译优化以太坊抗量子技术，为 Falcon、Dilithium 和 STARKs 协议显著降低 Gas 成本。
Proposed NTT precompile optimizes Ethereum post-quantum tech, reducing gas costs for Falcon, Dilithium, and STARKs protocols.
Latticefold and lattice-based operations performance report
Latticefold 优化报告展示格操作性能提升，采用 Goldilocks 环配置实现高效 NTT 乘法，适配安全与性能需求。
Latticefold report highlights lattice operation improvements using Goldilocks ring for efficient NTT multiplication, balancing security and performance.
Introducing bugs.zksecurity.xyz a knowledge base for ZK bugs
zkSecurity 推出 zkBugs 知识库，记录和分析零知识电路漏洞，促进开发者和研究者的安全改进协作。
zkSecurity launches zkBugs knowledge base to document and analyze ZK circuit vulnerabilities, fostering collaborative security improvements.
Introduction to Programmable Cryptography Workbook
这是 0xPARC 的《可编程密码学入门》工作簿，其主要目标是帮助读者理解书中的内容和概念。Jupyter Notebooks 直接将书中提到的算法和示例转化为代码，并以最直观的方式编写（即，不进行任何优化）。
This is 0xPARC's Introduction to Programmable Cryptography workbook. Its main objective is to help readers follow the book and its concepts. The Jupyter Notebooks directly translate the algorithms and examples mentioned in the book, written in the most straightforward manner possible (i.e., no optimizations).
Updates
AIR-ICICLE : Plonky3 on ICICLE, (part 1)
ICICLE V3.5: Sumcheck with Lambda Functions
Papers
“Check-Before-you-Solve”: Verifiable Time-lock Puzzles
Merkle Mountain Ranges are Optimal: On witness update frequency for cryptographic accumulators
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC
Diamond iO: A Straightforward Construction of Indistinguishability Obfuscation from Lattices
On the Power of Polynomial Preprocessing: Proving Computations in Sublinear Time, and More
Robust Non-Interactive Zero-Knowledge Combiners
LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
The Round Complexity of Black-Box Post-Quantum Secure Computation
Verifiable Streaming Computation and Step-by-Step Zero-Knowledge
TFHE Gets Real: an Efficient and Flexible Homomorphic Floating-Point Arithmetic
Error-Simulatable Sanitization for TFHE and Applications
Transistor: a TFHE-friendly Stream Cipher
Improved Resultant Attack against Arithmetization-Oriented Primitives
HasteBoots: Proving FHE Bootstrapping in Seconds
Transparent SNARKs over Galois Rings
Dazzle: Improved Adaptive Threshold Signatures from DDH
Context-Dependent Threshold Decryption and its Applications
Verifiable Computation for Approximate Homomorphic Encryption Schemes
How to Securely Implement Cryptography in Deep Neural Networks
Dynamic Decentralized Functional Encryption: Generic Constructions with Strong Security
Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments
DFS: Delegation-friendly zkSNARK and Private Delegation of Provers
Practical Zero-Trust Threshold Signatures in Large-Scale Dynamic Asynchronous Networks
FHE-SNARK vs. SNARK-FHE: From Analysis to Practical Verifiable Computation
Lattice-based Cryptography: A survey on the security of the lattice-based NIST finalists
Dimensional eROSion: Improving the ROS Attack with Decomposition in Higher Bases
Quasi-Linear Indistinguishability Obfuscation via Mathematical Proofs of Equivalence and Applications
Non-Interactive Key Exchange: New Notions, New Constructions, and Forward Security
Malleable SNARKs and Their Applications
Traceable Verifiable Random Functions
Lattice-based Sigma-Protocols for Polynomial Relations with Standard Soundness
Zinc: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers
Traceable Verifiable Secret Sharing and Applications
If you’d like to receive updates via email, subscribe us!
