20 results for “ZK-SNARKs”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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…
The paper presents black box algorithms for constructing standard generators and performing membership testing in Suzuki groups, with no false positives.
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…
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…
The paper presents an algorithm for pebble games that achieves optimal work and parallel depth for complete binary trees under a fixed space budget.
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.
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.
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.
This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.
This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.
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…
The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.
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…
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.
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…
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.
The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.