搜索结果: 1-12 共查到“军事学 SNARKs”相关记录12条 . 查询时间(0.075 秒)
Simple Yet Efficient Knowledge-Sound and Non-Black-Box Any-Simulation-Extractable ZK-SNARKs
NIZK QAP QSP
2019/6/4
Motivated by applications like verifiable computation and privacy-preserving cryptocurrencies, many efficient pairing-based SNARKs were recently proposed. However, the most efficient SNARKs like the o...
Zero-knowledge SNARKs (zk-SNARKs) have recently found various applications in verifiable computation and blockchain applications (Zerocash), but unfortunately they rely on a common reference string (C...
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings
zero knowledge zk-SNARKs universal SRS
2019/2/27
Zero-knowledge proofs have become an important tool for addressing privacy and scalability concerns in cryptocurrencies and other applications. In many systems each client downloads and verifies every...
Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short (i.e., independent of the size of the witness) and efficiently verifiable proofs. They elegantly resolve the juxtapositio...
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs
zero-knowledge common reference strings subvertability
2018/3/23
By design, existing (pre-processing) zk-SNARKs embed a secret trapdoor in a relation-dependent common reference strings (CRS). The trapdoor is exploited by a (hypothetical) simulator to prove the sche...
At Asiacrypt 2016 Bellare, Fuchsbauer and Scafuro introduced the notion of subversion zero knowledge for non-interactive proof systems, demanding that zero knowledge (ZK) is maintained even when the c...
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs
signatures of knowledge SNARKs simulation soundness
2017/6/9
We construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to signatures of knowle...
Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation
multi-party computation verifiable computation
2017/2/20
Pinocchio is a practical zk-SNARK that allows a prover to perform cryptographically verifiable computations with verification effort sometimes less than performing the computation itself. A recent pro...
On the (In)security of SNARKs in the Presence of Oracles
succinct non-interactive arguments knowledge extraction digital signatures
2016/2/23
In this work we study the feasibility of knowledge extraction for succinct non-interactive
arguments of knowledge (SNARKs) in a scenario that, to the best of our knowledge, has not been
analyzed bef...
Zk-SNARKs (succinct non-interactive zero-knowledge arguments
of knowledge) are needed in many applications. Unfortunately,
all previous zk-SNARKs for interesting languages are either inefficient
fo...
The past several years have seen tremendous advances in practical, general-purpose, noninteractive
proof systems called SNARKs. These building blocks are efficient and convenient,
with multiple publ...
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
succinct arguments zero-knowledge
2014/3/10
An argument system for NP is a proof system that allows efficient verification of NP statements, given proofs produced by an untrusted yet computationally-bounded prover. Such a system is non-interact...