Search
Search Results
-
Orion: Zero Knowledge Proof with Linear Prover Time
Zero-knowledge proof is a powerful cryptographic primitive that has found various applications in the real world. However, existing schemes with...
-
Succinct Non-Interactive Arguments via Linear Interactive Proofs
Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification....
-
Overview of Zero-Knowledge Proof and Its Applications in Blockchain
The rapid development of blockchain technology applications and the increased demand for data security has greatly driven the research on privacy...
-
Zero Knowledge Protocols and Signatures from the Restricted Syndrome Decoding Problem
The Restricted Syndrome Decoding Problem (R-SDP) cor- responds to the Syndrome Decoding Problem (SDP) with the additional constraint that all entries...
-
(Commit-and-Prove) Predictable Arguments with Privacy
Predictable arguments introduced by Faonio, Nielsen and Venturi [14] are private-coin argument systems where the answer of the prover can be...
-
A New Approach to Efficient Non-Malleable Zero-Knowledge
Non-malleable zero-knowledge, originally introduced in the context of man-in-the-middle attacks, serves as an important building block to protect...
-
Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection
We propose (honest verifier) zero-knowledge arguments for the modular subset sum problem. Previous combinatorial approaches, notably one due to...
-
Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers
Commitments to key-value maps (or, authenticated dictionaries) are an important building block in cryptographic applications, including...
-
Distilling Constraints in Zero-Knowledge Protocols
The most widely used Zero-Knowledge (ZK) protocols require provers to prove they know a solution to a computational problem expressed as a Rank-1...
-
ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for \(\mathbb {Z}_{2^k}\)
In this work, we extend the MPC-in-the-Head framework, used in recent efficient zero-knowledge protocols, to work over the ring...
-
Short-lived Zero-Knowledge Proofs and Signatures
We introduce the short-lived proof, a non-interactive proof of knowledge with a novel feature: after a specified period of time, the proof is no...
-
Explainable Arguments
We introduce an intriguing new type of argument systems with the additional property of being explainable. Intuitively by explainable, we mean that...
-
CRS-Updatable Asymmetric Quasi-Adaptive NIZK Arguments
A critical aspect for the practical use of non-interactive zero-knowledge (NIZK) arguments in the common reference string (CRS) model is the demand...
-
Polynomial IOPs for Memory Consistency Checks in Zero-Knowledge Virtual Machines
Zero-Knowledge Virtual Machines (ZKVMs) have gained traction in recent years due to their potential applications in a variety of areas, particularly...
-
Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier
Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the...
-
Your Reputation’s Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs
Distributed Zero-Knowledge (dZK) proofs, recently introduced by Boneh et al. (CRYPTO‘19), allow a prover...
-
Bulletproofs++: Next Generation Confidential Transactions via Reciprocal Set Membership Arguments
Zero-knowledge proofs are a cryptographic cornerstone of privacy-preserving technologies such as “Confidential Transactions” (CT), which aims at...
-
Lattice-Based Succinct Arguments from Vanishing Polynomials
Succinct arguments allow a prover to convince a verifier of the validity of any statement in a language, with minimal communication and verifier’s...
-
A Cross-domain Authentication Scheme Based on Zero-Knowledge Proof
This paper proposes an anonymous, cross-domain authentication scheme based on zero-knowledge proof to combat the privacy leakage problem of...
-
Efficient NIZK Arguments with Straight-Line Simulation and Extraction
Non-interactive zero-knowledge (NIZK) arguments allow a prover to convince a verifier about the truthfulness of an...