Search
Search Results
-
Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties
Non-interactive publicly verifiable secret sharing (PVSS) schemes enables (re-)sharing of secrets in a decentralized setting in the presence of...
-
Secure Non-interactive Reducibility is Decidable
Secure Non-Interactive Reductions (SNIR) is a recently introduced, but fundamental cryptographic primitive. The basic question about SNIRs is how to...
-
Non-interactive Distributional Indistinguishability (NIDI) and Non-malleable Commitments
We introduce non-interactive distributionally indistinguishable arguments (NIDI) to address a significant weakness of NIWI proofs: namely, the lack...
-
Conflict-Driven Satisfiability for Theory Combination: Lemmas, Modules, and Proofs
Search-based satisfiability procedures try to build a model of the input formula by simultaneously proposing candidate models and deriving new...
-
Combining Proofs for Description Logic and Concrete Domain Reasoning
Logic-based approaches to AI have the advantage that their behavior can in principle be explained with the help of proofs of the computed...
-
Rogue-Instance Security for Batch Knowledge Proofs
We propose a new notion of knowledge soundness, denoted rogue-instance security, for interactive and non-interactive batch knowledge proofs. Our...
-
Code-based signatures from new proofs of knowledge for the syndrome decoding problem
In this paper, we study code-based signatures constructed from Proofs of Knowledge (PoK). This line of work can be traced back to Stern who...
-
SNACKs: Leveraging Proofs of Sequential Work for Blockchain Light Clients
The success of blockchains has led to ever-growing ledgers that are stored by all participating full nodes. In contrast, light clients only store...
-
Non-Interactive Anonymous Router
Anonymous routing is one of the most fundamental online privacy problems and has been studied extensively for decades. Almost all known approaches...
-
Malleable Commitments from Group Actions and Zero-Knowledge Proofs for Circuits Based on Isogenies
Zero-knowledge proofs for NP statements are an essential tool for building various cryptographic primitives and have been extensively studied in...
-
-
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs
In their seminal work, Ishai, Kushilevitz, Ostrovsky, and Sahai (STOC‘07) presented the MPC-in-the-Head paradigm, which shows how to design...
-
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
Verifiable random functions (VRFs) are pseudorandom functions where the owner of the seed, in addition to computing the function’s value y at any...
-
LaBRADOR: Compact Proofs for R1CS from Module-SIS
The most compact quantum-safe proof systems for large circuits are PCP-type systems such as Ligero, Aurora, and Shockwave, that only use weak...
-
Non-interactive Proofs of Proof-of-Work
Decentralized consensus protocols based on proof-of-work (PoW) mining require nodes to download data linear in the size of the blockchain even if...
-
Secure Non-interactive Reduction and Spectral Analysis of Correlations
Correlated pairs of random variables are a central concept in information-theoretically secure cryptography. Secure reductions between different...
-
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...
-
Parallel Repetition of \((k_1,\dots ,k_{\mu })\) -Special-Sound Multi-round Interactive Proofs
In many occasions, the knowledge error \(\kappa \)...
-
Single-to-Multi-theorem Transformations for Non-interactive Statistical Zero-Knowledge
Non-interactive zero-knowledge proofs or arguments allow a prover to show validity of a statement without further interaction. For non-trivial...
-
Succinct Interactive Oracle Proofs: Applications and Limitations
Interactive Oracle Proofs ( \(\textsf{IOP}\) s)...