Search
Search Results
-
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees
Lookup arguments allow to prove that the elements of a committed vector come from a (bigger) committed table. They enable novel approaches to reduce...
-
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
An accumulator is a function that hashes a set of inputs into a short, constant-size string while preserving the ability to efficiently prove the...
-
Non-interactive Zero-Knowledge from Non-interactive Batch Arguments
Zero-knowledge and succinctness are two important properties that arise in the study of non-interactive arguments. Previously, Kitagawa et al. (TCC...
-
Efficient Zero-Knowledge Arguments and Digital Signatures via Sharing Conversion in the Head
We present a novel technique within the MPC-in-the-Head framework, aiming to design efficient zero-knowledge protocols and digital signature schemes....
-
Zero-Knowledge Arguments for Subverted RSA Groups
This work investigates zero-knowledge protocols in subverted RSA groups where the prover can choose the modulus and where the verifier does not know...
-
Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems
We present a cryptographic string commitment scheme that is computationally hiding and binding based on (modular) subset sum problems. It is believed...
-
A zero-knowledge proof of transpose of a matrix of finite field elements
Interactive zero-knowledge arguments for some fundamental linear algebraic operations have been formulated. But those arguments cannot be used for...
-
Nova: Recursive Zero-Knowledge Arguments from Folding Schemes
We introduce a new approach to realize incrementally verifiable computation (IVC), in which the prover recursively proves the correct execution of...
-
Sok: vector OLE-based zero-knowledge protocols
A zero-knowledge proof is a cryptographic protocol where a prover can convince a verifier that a statement is true, without revealing any further...
-
Efficient Zero-Knowledge Arguments for Matrix Relations over Rings and Non-malleable Enhancement
Various matrix relations widely appeared in data-intensive private computations, as a result their efficient zero-knowledge proofs/ arguments are...
-
Zero-Knowledge Range Arguments for Signed Fractional Numbers from Lattices
Range proofs introduced by Brickell et al. at CRYPTO 1988, allow a prover to convince a verifier that the committed value belongs to an interval...
-
Flashproofs: Efficient Zero-Knowledge Arguments of Range and Polynomial Evaluation with Transparent Setup
We propose Flashproofs, a new type of efficient special honest verifier zero-knowledge arguments with a transparent setup in the discrete logarithm...
-
Strong Batching for Non-interactive Statistical Zero-Knowledge
A zero-knowledge proof enables a prover to convince a verifier that $$x \in...
-
-
Efficient non-interactive zero-knowledge proofs for quantum range verification in blockchain
Blockchain technology is incredibly popular nowadays which is based on a distrusted ledger technology (DLT) and decentralized database that stores...
-
Zero-Knowledge Functional Elementary Databases
Zero-knowledge elementary databases (ZK-EDBs) enable a prover to commit a database D of key-value (x, v) pairs and later provide a convincing answer...
-
Zero-Knowledge Predicates for Hashing to Prime: Theory and Applications
Hashing to prime in zero-knowledge takes as input a committed secret \(a\)...
-
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions
Building on recent compilers for efficient disjunctive composition (e.g. an OR of multiple clauses) of zero-knowledge proofs (e.g. Goel et al....
-
An efficient quantum non-interactive zero knowledge proof for confidential transaction and quantum range proof
This paper investigated the Bitcoin blockchain and other crypto currencies confidential transaction techniques for cryptographic commitment in a...
-
Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier
We propose three interactive zero-knowledge arguments for arithmetic circuit of size N in the common random string model, which can be converted to...