ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “ZK-SNARKs”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CRMar 27, 2026

Hermes Seal: Zero-Knowledge Assurance for Autonomous Vehicle Communications

Munawar Hasan, Apostol Vassilev, Edward Griffor, Thoshitha Gamage

The paper proposes Hermes Seal, a zk-SNARK framework that enables autonomous vehicles to generate cryptographic proofs of their internal computations and perceptions without revealing sensitive propri…

View →
math.GRcs.DSTheoreticalRecentJul 19, 2026

Black Box Recognition of the Suzuki groups

John N. Bray, Henrik Bäärnhielm

The paper presents black box algorithms for constructing standard generators and performing membership testing in Suzuki groups, with no false positives.

View →
cs.ARcs.CRRecentJun 2, 2026

ZK-Flex: A Flexible and Scalable Framework for Accelerating Zero-Knowledge Proofs

Adiwena Putra, Cuong Manh Duong, Anh Quang Pham, Joo-Young Kim

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

View →
cs.ARcs.CRRecentJun 2, 2026

ZK-Flex: A Flexible and Scalable Framework for Accelerating Zero-Knowledge Proofs

Adiwena Putra, Cuong Manh Duong, Anh Quang Pham, Joo-Young Kim

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

View →
cs.CCTheoreticalRecentOct 7, 2026

Optimal (Parallel) Spooky Pebbling on Binary Trees

Mingyu Lee, Sanghyun Lee, Kabgyun Jeong

The paper presents an algorithm for pebble games that achieves optimal work and parallel depth for complete binary trees under a fixed space budget.

View →
math.COcs.DMTheoreticalRecentJun 15, 2026

On a Taylor-Zwicker Construction for Balanced Families and a Conjecture of Moss and Pedersen

Sa'ul A. Blanco

The paper studies balanced subfamilies of the middle layer of the Boolean lattice and proves a conjecture about the existence of a family with no balanced subfamilies of certain sizes.

View →
cs.CCcs.DSTheoreticalRecentAug 5, 2026

On the Approximability of Boolean Max-$k$-CSP

Ainesh Bakshi

This paper presents a polynomial time algorithm for maximizing the number of satisfied constraints in a boolean constraint satisfaction problem, achieving a $(k/2^k)$-approximation.

View →
cs.DScs.CCq-bio.PERecentMay 29, 2026

Tree Containment Parameterized by Scanwidth

Leo van Iersel, Mark Jones, Mathias Weller

This paper develops a parameterized algorithm for the NP-complete Tree Containment problem, showing it can be solved efficiently based on a structural parameter called scanwidth.

View →
cs.CCTheoreticalRecentJun 14, 2026

Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry

Ali Ahmadi, Kiarash Banihashem, Iman Gholami, Mohammad Taghi Hajiaghayi +1 more

This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.

View →
cs.ITTheoreticalRecentJun 19, 2026

Error Exponent Bounds for Optimal Short-Read Clustering

Yoav Chachamovitz, Nir Weinberger

This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.

View →
cs.DMmath.NTTheoreticalRecentJul 16, 2026

Conjectural Decidability of the Skolem Problem

Florian Luca, Joël Ouaknine, James Worrell

This paper introduces the concept of 'large' zeros in linear recurrence sequences and establishes that they either do not exist or are very sparse, which could lead to decidability of the Skolem Probl…

View →
cs.DScs.CCcs.ITTheoreticalRecentJun 9, 2026

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

Yuzhou Gu, Xin Li, Yinzhan Xu

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

View →
cs.CRcs.CYcs.DCMar 26, 2026

zk-X509: Privacy-Preserving On-Chain Identity from Legacy PKI via Zero-Knowledge Proofs

Yeongju Bak

zk-X509 is a privacy-preserving identity system that uses zero-knowledge proofs to prove ownership of standard X.509 certificates on a public blockchain without revealing private keys or personal data…

View →
cs.DScs.CCmath.COTheoreticalRecentJul 17, 2026

Contextual Fraction on Permutation Gain Graphs: Exact Algorithms, Query Lower Bounds, and Dynamic Maintenance

Ronald Katende

This paper identifies a tractability island inside the contextual-fraction problem by collapsing it to a fixed-point calculation for a specific class of permutation-transport models.

View →
cs.AIRecentMay 27, 2026

STAB: Specification-driven Testing for Algorithmic Bottlenecks

Soohan Lim, Joonghyuk Hahn, Hyundong Jin, Yo-Sub Han

STAB is a novel specification-driven pipeline that generates test cases exposing algorithmic bottlenecks by combining constraint-bound maximization and adversarial structure injection, significantly i…

View →
cs.AREmpiricalRecentOct 20, 2026

ZKPU: Zero-Knowledge Processing Unit for Heterogeneous Workloads

Jonathan Ku, Changchun Zhou, Jiawen Wu, Sangouk Jeon +7 more

This paper presents a Zero-Knowledge Processing Unit (ZKPU) that accelerates zero-knowledge proofs for both curve-based and hash-based protocols.

View →
cs.DCcs.CCcs.FLTheoreticalRecentJun 9, 2026

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties

Chiara Piombi

The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.

View →