搜索结果: 1-4 共查到“军事学 zk-SNARKs”相关记录4条 . 查询时间(0.059 秒)
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) 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...
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...