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.CRRecentMar 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.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.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.DMcs.CGTheoreticalRecentJun 11, 2026

On the Counting Sequence of Z-convex Polyominoes

Luca Castelli, Paolo Massazza

This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.

View →
cs.CRcs.CYcs.DCRecentMar 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.CRcs.SERecentApr 30, 2026

zkSBOM: Privacy-Preserving SBOM Sharing with Zero-Knowledge Sets

Tom Sorger, Eric Cornelissen, Aman Sharma, Javier Ron +2 more

zkSBOM introduces a zero-knowledge mechanism for sharing Software Bills of Materials (SBOMs) that allows consumers to check for vulnerabilities without suppliers revealing the full, sensitive contents…

View →
cs.GTcs.CCTheoreticalRecentJun 11, 2026

On Cutting Cakes and Crossing Curves

Alexandros Hollender, Gilbert Maystre, Kilian Risse

The paper shows that the envy-free cake-cutting problem with three agents is intractable and establishes the first lower bounds for the Jordan curve problem.

View →
math.COcs.DMmath.CTTheoreticalRecentJul 9, 2026

Subword representations and weak hypercube dimension for acyclic categories

Isaac Carcacía-Campos

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

View →
cs.CRcs.AIcs.SERecentApr 14, 2026

TEMPLATEFUZZ: Fine-Grained Chat Template Fuzzing for Jailbreaking and Red Teaming LLMs

Qingchao Shen, Zibo Xiao, Lili Huang, Enwei Hu +2 more

TEMPLATEFUZZ is a fine-grained fuzzing framework that systematically tests chat templates to find vulnerabilities in LLMs, achieving high jailbreak success rates with minimal performance degradation.

View →
cs.CCcs.DMcs.DSTheoreticalRecentJul 3, 2026

Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width

Thobias Kvalvik Høivik, Erlend Raa Vågset

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…

View →
cs.ARcs.CLcs.CRRecentApr 20, 2026

Enabling AI ASICs for Zero Knowledge Proof

Jianming Tong, Jingtian Dang, Simon Langowski, Tianhao Huang +5 more

The paper introduces MORPH, a framework that reformulates Zero-Knowledge Proof (ZKP) computations to efficiently utilize AI ASICs like TPUs, achieving up to 10x higher throughput on NTT.

View →