Lattice-based Σ - Protocols for Polynomial Relations with Standard Soundness by Lizhen Zhang, Shang Gao and Bin Xiao: https://eprint.iacr.org/2025/313
This paper reveals new techniques to improve the efficiency of Σ-protocols in lattice-based cryptography. The approach refines a recent method called LatticeFold, allowing for more efficient proofs of polynomial relations without repeated iterations or relaxed constraints. By introducing new folding and linearization techniques, the work enhances ZKPs while maintaining standard soundness. These advancements contribute to the broader goal of making post-quantum cryptographic protocols more practical and secure against quantum threats.
Bulletproofs for R1CS: Bridging the Completeness-Soundness Gap and a ZK Extension by Gil Segev: https://eprint.iacr.org/2025/327
The paper presents Bulletproofs, a non-interactive argument system, to address a gap in completeness and soundness when applied to Rank-1 Constraint Satisfaction. The research extends previous work by refining the proof structure, ensuring consistency without introducing unwanted gaps. The improved system maintains efficiency while also incorporating ZK properties. By bridging this gap, the extended Bulletproofs framework enhances security and reliability in cryptographic applications, particularly in proofs that rely on arithmetic circuit satisfiability.
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs by Benny Applebaum and Eliran Kachlon: https://eprint.iacr.org/2025/334
This paper introduces an information-theoretic approach that enables secure multiparty computation and enhances ZKP systems. The framework allows non-interactive proof combinations while preserving privacy and efficiency. Key applications include improvements to multi-string NIZK proofs and round-optimal multiparty computation, all relying on minimal cryptographic assumptions like one-way functions. This work resolves several longstanding challenges in cryptographic protocol design.
Publicly Verifiable Generalized Secret Sharing and Its Application in Building Decentralized Exchange by Liang Zhang, Dongliang Cai, Tao Liu, Haibin Kan, Jiheng Zhang, Haibin Zhang and Sisi Duan: https://eprint.iacr.org/2025/344
The paper describes a publicly verifiable generalized secret sharing scheme, enhancing traditional secret sharing by allowing flexible access structures and public verification. It combines generalized secret sharing with NIZK to improve transparency and security in decentralized environments. The authors apply this to build a decentralized exchange where users can fairly swap ERC-20 tokens with arbitration provided by passive watchers. The study includes a performance evaluation, demonstrating the feasibility of PVGSS for real-world applications like secure access control, blockchain oracles, and multiparty computation.
Efficient NIZK Arguments with Straight-Line Simulation and Extraction by Michele Ciampi and Ivan Visconti: https://eprint.iacr.org/2025/352
This study examines a method for NIZK arguments that avoids programming the random oracle, making it easier to use alongside other cryptographic protocols. The proposed system relies on quasi-polynomial time simulation and dense cryptographic puzzles to ensure security without sacrificing efficiency. By modifying Fischlin’s approach, it achieves a NIZK argument with straight-line simulation and extraction, supporting practical applications that require composability and strong security guarantees.
A Note on Zero-Knowledge Simulator of the CROSS Identification Protocol by Shai Levin: https://eprint.iacr.org/2025/359
This work highlights a flaw in the CROSS identification protocol, part of a candidate for NIST's digital signature competition. The analysis shows that real and simulated transcripts of the protocol can be distinguished when the witness is known, meaning CROSS-ID fails to achieve strong ZK guarantees. Although the impact on the signature scheme is unclear, this issue could affect applications like anonymous ring signatures that rely on strong ZK properties.
Split Prover Zero-Knowledge SNARKs by Sanjam Garg, Aarushi Goel, Dimitris Kolonelos, Sina Shiehian and Rohit Sinha: https://eprint.iacr.org/2025/373
Several researchers co-introduced a new way to generate zkSNARK proofs called "split prover zkSNARKs", letting proof creation happen in two parts. Built on Groth16, the method allows partial delegation while hiding sensitive information and could help with anonymous transactions, like in cryptocurrencies, or other systems that need privacy-preserving proof generation without slowing down verification.
On the Security and Privacy of CKKS-based Homomorphic Evaluation Protocols by Intak Hwang, Seonhong Min, Jinyeong Seo and Yongsoo Song: https://eprint.iacr.org/2025/382
This paper discusses a new framework to improve privacy in CKKS-based homomorphic encryption protocols, widely used for secure machine learning. It proposes replacing traditional privacy definitions with differential privacy to protect the sender's data more efficiently. The approach uses moderate noise addition and ZKPs, making it more practical. The authors also designed and tested a new proof system specifically for CKKS, demonstrating it can be both secure and computationally feasible.
SNARKs for Stateful Computations on Authenticated Data by Johannes Reinhart, Erik-Oliver Blass and Bjoern Annighoefer: https://eprint.iacr.org/2025/404
This paper presents ADSC-SNARKs, a new form of SNARKs that allow verifying both the correctness of computations and the authenticity of input data, while also handling stateful computations across multiple rounds. Unlike other methods, this approach avoids inefficient hashing or signature verification inside proofs, making it faster and smaller. Its practicality is demonstrated with a quadcopter control system, achieving significantly reduced proof sizes and verification times compared to existing solutions.
Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments by Chaya Ganesh, Sikhar Patranabis and Nitin Singh: https://eprint.iacr.org/2025/419
The paper introduces Samaritan, a new SNARK system that offers a faster and more efficient way to verify computations. It presents a novel multilinear polynomial commitment scheme, SamaritanPCS, which improves proof size and verification time over existing methods. Unlike previous systems, Samaritan achieves constant proof size with linear-time proving, making it practical for large-scale computations. It outperforms alternatives like Spartan and Gemini in important aspects such as argument size and verification efficiency.
Fine-Grained Verifier NIZK and Its Applications by Shuai Han, Shengli Liu, Xiangyu Liu and Dawu Gu: https://eprint.iacr.org/2025/434
This paper introduces a new cryptographic method called Fine-Grained Verifier Non-Interactive Zero-Knowledge. This approach allows more flexible proof verification by enabling specific users to check proofs without fully public or fully private verification. They also demonstrate applications in encryption and functional encryption, managing to avoid pairings for better efficiency. Their method balances verifiability and privacy, addressing limitations of existing ZKP systems.
Black-Box (and Fast) Non-Malleable Zero Knowledge by Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi and Ivan Visconti: https://eprint.iacr.org/2025/432
A team of researchers has developed the first Non-Malleable Zero-Knowledge argument system using only black-box one-way functions, solving a long-standing open problem in cryptography. Their protocol runs in a constant number of rounds and achieves better efficiency than previous solutions, significantly reducing computational overhead and communication costs. This advancement strengthens security against man-in-the-middle attacks while simplifying the underlying cryptographic tools needed for practical apps.
