Highlights

Introducing ZKnox

这个新研究组织处于先进加密技术的前沿，由以太坊基金会资助。他们的使命：提供高影响力的开源代码，以提高以太坊的安全性和效率。

• https://x.com/ethereumfndn/status/1896592240228893072
• https://zknox.eth.limo/

BitVM: Unlocking Arbitrary Computation on Bitcoin Through Circuit Abstractions

BitVM 通过电路抽象在比特币上实现任意计算，利用契约、状态保持和分支克服 UTXO 限制。

• https://blog.zksecurity.xyz/posts/bitvm/

The Ethereum Cypherpunk Manifesto

• https://x.com/pcaversaccio/status/1895806679704306130
• https://hackmd.io/@pcaversaccio/the-ethereum-cypherpunk-manifesto

Updates

TFHE-rs v1.0.0

• https://x.com/zama_fhe/status/1895147693632094400
• https://github.com/zama-ai/tfhe-rs/releases/tag/tfhe-rs-1.0.0

zkVMs benchmarks

• https://github.com/yetanotherco/zkvm_benchmarks

Unearthing the Reality of zkTLS: A Benchmarking and Cryptanalysis Report

• https://hackmd.io/@-fI_Eu_rR8qs02aOhOPWNg/HkRyz5OF1g

Visual Algebra YouTube lectures

• https://www.math.clemson.edu/~macaule/visualalgebra/youtube/index.html

World-leaders in Cryptography: Anna Lysyanskaya

• https://www.youtube.com/watch?v=o6bq-eMgTBI

D/INFRA SUMMIT 2025 | ETHDENVER

• https://www.youtube.com/playlist?list=PLVyprqZE7mr2tt1K-R2cWlI2HlHlNhYT7

Papers

The Algebraic One-More MISIS Problem and Applications to Threshold Signatures

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

Fine-Grained Verifier NIZK and Its Applications

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

Black-Box (and Fast) Non-Malleable Zero Knowledge

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

Commitment Schemes Based on Module-LIP

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

BUFFing Threshold Signature Schemes

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

A Note on Obfuscation-based Attacks on Private-coin Evasive LWE

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

Non-Interactive Verifiable Aggregation

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

Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments

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

ProofFrog: A Tool For Verifying Game-Hopping Proofs

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

Multi-Authority Functional Encryption: Corrupt Authorities, Dynamic Collusion, Lower Bounds, and More

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

Low Communication Threshold FHE from Standard (Module-)LWE

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

Hybrid Obfuscated Key Exchange and KEMs

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

Delegatable ABE with Full Security from Witness Encryption

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

Withdrawable signatures in Fiat-Shamir with aborts constructions

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

SNARKs for Stateful Computations on Authenticated Data

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

Re-Randomize and Extract: A Novel Commitment Construction Framework Based on Group Actions

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

Tight Adaptive Simulation Security for Identity-based Inner-Product FE in the (Quantum) Random Oracle Model

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

Blind Signatures from Cryptographic Group Actions

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

Reducing the Number of Qubits in Solving LWE

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

An Efficient Quantum Oblivious Transfer Protocol

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

Monotone-Policy BARGs and More from BARGs and Quadratic Residuosity

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

Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption (Part II: zeroizing attacks against private-coin evasive LWE assumptions)

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

Fair Exchange for Decentralized Autonomous Organizations via Threshold Adaptor Signatures

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

MERCURY: A multilinear Polynomial Commitment Scheme with constant proof size and no prover FFTs

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

On the Security and Privacy of CKKS-based Homomorphic Evaluation Protocols

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

A Complete Security Proof of SQIsign

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

Evasive LWE: Attacks, Variants & Obfustopia

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

Simple and General Counterexamples for Private-Coin Evasive LWE

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

Split Prover Zero-Knowledge SNARKs

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

Polynomial Secret Sharing Schemes and Algebraic Matroids

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

Partial Lattice Trapdoors: How to Split Lattice Trapdoors, Literally

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

Enabling Microarchitectural Agility: Taking ML-KEM & ML-DSA from Cortex-M4 to M7 with SLOTHY

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

Lattice-Based Updatable Public-Key Encryption for Group Messaging

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

Predicate Encryption from Lattices: Enhanced Compactness and Refined Functionality

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

Vanishing Short Integer Solution, Revisited: Reductions, Trapdoors, Homomorphic Signatures for Low-Degree Polynomials

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

A Note on Zero-Knowledge Simulator of the CROSS Identification Protocol

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

The Complexity of Memory Checking with Covert Security

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

Lattice-based Proof-Friendly Signatures from Vanishing Short Integer Solutions

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

Commit-and-Prove System for Vectors and Applications to Threshold Signing

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