Non-Interactive Zero-Knowledge Proofs
Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge
... of Knowledge Pyrros Chaidos ? and Geoffroy Couteau ?? ...designated-verifier non-interactive zero-knowledge proofs (DVNIZK) for a wide class of algebraic languages over abelian ...
34
Non-Interactive Zero-Knowledge Proofs of Non-Membership
... for Zero-Knowledge Proofs with Witness Elimination This issue comes from the fact that the validity of the projection key hp is nowhere verified in the generic descrip- ...
18
Non-Interactive Zero-Knowledge Proofs for Composite Statements
... In this section we use the building blocks we constructed in Sections 4 and 3, to devise proofs for compound statements. In the following, we distinguish between functions that have an efficient al- gebraic ...
42
Non-interactive zero-knowledge proofs in the quantum random oracle model
... Online-extractable proofs are a specific form of proofs of knowledge where extraction is supposed to work by only looking at the proofs generated by the adversary and at the oracle queries ...
26
Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
... Else return (verification, sid, pid, 0) Figure 3: Universally composable NIZK proof for R. Theorem 8 The protocol φ in Figure 3 securely realizes F NIZK R in the F NIZK R F -hybrid model. Proof. We have to show that for ...
14
Non-interactive zero knowledge proofs for the authentication of IoT devices in reduced connectivity environments
... novel non- interactive zero-knowledge (NIZKP) authentication protocol that incorporates the limiting factors in IoT communication devices and ...
38
Non-Interactive Proofs for Integer Multiplication
... Non-Interactive Proofs for Integer Multiplication Ivan Damg˚ ard and Rune Thorbek BRICS, ...and non-interactively, secret-share an integer among a set of ...in zero-knowledge ...
20
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs
... of non-interactive zero-knowledge proofs it was necessary to have a deterministic evaluation algorithm such that the computation could be replicated by the verifier who knew what the ...
22
Zero-Knowledge Multi-Prover Interactive Proofs
... Lemma 4.7. Suppose that an oracle H stores a function A. Then there is a polynomial-time oracle machine interacting with H that will always accept if A is multilinear, but reject with probability exponentially close to 1 ...
50
Additive Proofs of Knowledge - A New Notion For Non-Interactive Proofs
... The rest of this paper is organized as follows. In Section 2, we give some background on zero- knowledge. In Section 3, we give the intuition behind our idea of additive zero-knowledge by ...
9
Perfect Non-Interactive Zero Knowledge for NP
... The main idea in overcoming these hurdles is to commit to the witness w and make a NIZK proof that indeed we have committed to a witness w so C(w) = 1. We must show that our NIZK proof has a simulation-soundness property ...
24
Non-Locality in Interactive Proofs
... Second, the non-locality of simulators is a characterization of the resilience of zero-knowledge. A protocol with local simulators which can withstand arbitrary (malicious) verifiers is more ...
26
Efficient Zero-Knowledge Proofs and Applications
... the non-interactive form of PK w : R( s , w ) = 1 using the above transformation and nonce M ...the interactive protocol and the Fiat-Shamir transformed protocol is that, in the latter case, P ∗ ...
203
Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost
... [GS08] Jens Groth and Amit Sahai. Efficient non-interactive proof systems for bilinear groups. In Nigel P. Smart, editor, Advances in Cryptology – EUROCRYPT 2008, volume 4965 of Lecture Notes in Computer ...
18
Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
... PGHR13, BCGTV13a, BFRS + 13], thus granting these systems universality: once-and-for-all key generation. Similarly, our zk-SNARK for circuits can replace the underlying zk-SNARKs in [PGHR13, BCGTV13a, BFRS + 13], or be ...
37
Towards Non-Interactive Zero-Knowledge for NP from LWE
... To construct our NIZK proof system, we introduce a new notion that we call prover-assisted oblivious ciphertext sampling (POCS), which we believe to be of independent interest. This notion extends the idea of oblivious ...
34
A Survey of Zero-Knowledge Proofs with Applications to Cryptography
... produced by the non-interactive computation C ∗ . In other words, whatever information can be learned by interacting with A on some input x can also be extracted from x without interacting with A. Remark ...
12
Computational soundness of symbolic zero-knowledge proofs
... (non-interactive) zero-knowledge proof needs to fulfill in order to serve as a computa- tionally sound implementation of symbolic zero-knowledge ...symbolically-sound ...
64
Succinct Non-Interactive Arguments via Linear Interactive Proofs
... preprocessing SNARKs that are zero-knowledge (against malicious verifiers in the CRS model). For the Hadamard-based LIP, an HVZK variant can be obtained directly with essentially no additional cost. More ...
60
Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
... Further optimizations and specific parameter choices for the above proof are discussed in the remainder of the paper. 1.3 Outline of the Paper In Section 2, we present the details of the MPC protocol Π we use, and ...
26