[PDF] Top 20 Efficient Generic Zero-Knowledge Proofs from Commitments
Has 10000 "Efficient Generic Zero-Knowledge Proofs from Commitments" found on our website. Below are the top 20 most common "Efficient Generic Zero-Knowledge Proofs from Commitments".
Efficient Generic Zero-Knowledge Proofs from Commitments
... on commitments in the standard model proves to be even more efficient and adds no additional assumptions, see the PKC 2015 paper in [4] (improving on ...extremely efficient, since it only relies on ... See full document
33
Practical Relativistic Zero-Knowledge for NP
... and efficient solution to the 3-COL problem that uses only two provers, each of which is queried with either a node from a common edge, or twice the same ...use commitments at all but unfortunately ... See full document
17
Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification
... communication. Zero-knowledge (ZK) proofs 1 constitute ar- guably the most prominent such ...of efficient cryptographic implementations of this primitive for special classes of problems, have ... See full document
36
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash
... The compute block carries out the specified compu- tations. There are two types of computations: picking a random value, and defining a value by setting it equal to the right-hand side of an equation. We can see an ex- ... See full document
16
Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution
... knowledge proof system with sublinear communication and efficient verification. The prover time, however, would incur at least a logarithmic overhead compared to the time to execute the TinyRAM program. ... See full document
75
Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost
... We propose a new solution for zero-knowledge proof of statements of the form ∃w : R(M, x, w) = 1 where R is a RAM program and M is its (large) memory. Here, M is committed upfront by the prover and can in ... See full document
18
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits
... neither zero-knowledge proofs nor arguments can be achieved in less than four rounds without additional as- sumptions [GK96], we devise our protocols in the CRS model where the CRS is short unlike ... See full document
47
Compact Zero-Knowledge Proofs of Small Hamming Weight
... a zero- knowledge proof that a committed vector has Hamming weight bounded by a given ...OT from black-box use of 1-out-of-2 OT, 2) separa- ble accountable ring signatures, 3) more efficient ... See full document
31
Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives
... solely from symmetric-key primitives and that our proofs are of sublinear ...Regarding efficient instantiations of our proof sys- tem, we rely on recent results for constructing efficient ... See full document
24
Non-Interactive Zero-Knowledge Proofs of Non-Membership
... of commitments and corresponding zero- knowledge proofs is often ...chosen from a list of candidates, see [CCs08] and references ... See full document
18
Non-interactive zero-knowledge proofs in the quantum random oracle model
... NIZK proofs. Zero-knowledge proofs are an vital tool in modern ...Traditional zero-knowledge proofs ...non-interactive zero-knowledge (NIZK) proofs ... See full document
26
Efficient Post-Quantum Zero-Knowledge and Signatures
... prove knowledge of ...the commitments and output shares from each view to the random oracle computes a challenge – the challenge tells the prover which two of the three views to open for each of the ... See full document
36
One-Message Zero Knowledge and Non-Malleable Commitments
... an efficient non-uniform adversary cannot do more than hardwire false statements with their accepting proofs in its ...accepting proofs cannot be significantly compressed. The ... See full document
59
Languages with Efficient Zero-Knowledge PCP's are in SZK
... with efficient ZK-PCPs are exactly those in SZK ∩ ...of efficient ZK-PCPs for NP comes from a recent line of work on basing cryptography on tamper-proof hardware ...statistical ... See full document
19
An Energy-efficient and Real-time Anonymous Routing Protocol for Ad hoc Networks
... receiver from the RREQ packet, while other nodes can not verify the destination from the RREQ ...an efficient way to construct the trapdoor, and that is the Zero Knowledge Proofs ... See full document
13
Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage
... given from absolute leakage-resilient ID schemes to leakage-resilient signature schemes and AKA ...more efficient transformation is described by the authors that employs subset selection and reduces both ... See full document
21
RLWE-based Zero-Knowledge Proofs for linear and multiplicative relations
... point from a different ...overhead from Xie et ...Honest-Verifier Zero-Knowledge is obtained as we explicitly provide a perfect simulator for each ...iliary commitments, as they can ... See full document
30
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge
... of zero-knowledge proofs, called instance- dependent zero-knowledge, and show that it suffices for the [8] approach when constructing a compiler from honest-verifier statistical ... See full document
23
Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge
... apart from publicly-verifiable NIZKs (which can be seen as particular types of DVNIZKs where the secret key of the verifier is the empty string), the only known construction of DVNIZK claiming to satisfy unbounded ... See full document
34
Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
... on zero-knowledge proofs from secure multiparty computation aims at a similar goal as this ...ZK proofs from MPC; When instantiated with simple MPC protocols like GMW [GMW87] ... See full document
22
Related subjects