搜索结果: 1-15 共查到“军事学 Zero-knowledge proofs”相关记录46条 . 查询时间(0.078 秒)
There Are 10 Types of Vectors (and Polynomials): Efficient Zero-Knowledge Proofs of "One-Hotness" via Polynomials with One Zero
Zero-knowledge efficiency privacy-preserving protocols
2019/8/30
We present a new 4-move special honest-verifier zero-knowledge proof of knowledge system for proving that a vector of Pedersen commitments opens to a so-called "one-hot" vector (i.e., to a vector from...
Non-Interactive Zero Knowledge Proofs in the Random Oracle Model
FS transform NIZK random oracle model
2019/8/22
The Fiat-Shamir (FS) transform is a well known and widely used technique to convert any constant-round public-coin honest-verifier zero-knowledge (HVZK) proof or argument system CIPC=(Prov,Ver)CIPC=(P...
Improvements in Everlasting Privacy: Efficient and Secure Zero Knowledge Proofs
Voting Everlasting Privacy Zero Knowledge Proofs
2019/8/8
Verifiable electronic voting promises to ensure the correctness of elections even in the presence of a corrupt authority, while providing strong privacy guarantees. However, few practical systems with...
Efficient Perfectly Sound One-message Zero-Knowledge Proofs via Oracle-aided Simulation
zero-knowledge NIZK RSA ZAP
2019/6/26
In this paper we put forth new one-message proof systems for several practical applications, like proving that an El Gamal ciphertext (over a multiplicative group) decrypts to a given value and correc...
Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-
Blockchain Digital Signatures Zero-knowledge Proofs
2019/6/5
Timestamping is an important cryptographic primitive with numerous applications. The availability of a decentralized blockchain such as that offered by the Bitcoin protocol offers new possibilities to...
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs
Lattices Zero-Knowledge Proofs Commitments
2019/6/4
A key component of many lattice-based protocols is a zero-knowledge proof of knowledge of a vector s⃗ s→ with small coefficients satisfying As⃗ =u⃗ modqAs→=u→modq. While there exist ...
Lattice-based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications
lattice-based cryptography zero-knowledge proof CRT packing, ring signature
2019/5/9
We devise new techniques for design and analysis of efficient lattice-based zero-knowledge proofs (ZKP). First, we introduce one-shot proof techniques for non-linear polynomial relations of degree k≥2...
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
Zero knowledge proof interactive proof polynomial delegation
2019/4/1
We present Libra, the first zero-knowledge proof system that has both optimal prover time and succinct proof size/verification time. In particular, if C is the size of the circuit being proved (i) the...
How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs
linear PCPs proof systems zero knowledge
2019/3/1
We introduce and study the notion of fully linear probabilistically checkable proof systems. In such a proof system, the verifier can make a small number of linear queries that apply jointly to the in...
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs
zero knowledge implementation zk-SNARKs framework
2019/2/26
We study the problem of building SNARKs modularly by linking small specialized “proof gadgets" SNARKs in a lightweight manner. Our motivation is both theoretical and practical. On the theoretical side...
Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains without Trusted Setup
public-key cryptography zero knowledge
2019/1/26
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while efficient zero-knowledge proofs of algebraic statements have existed for decades, a natural challenge aros...
Non-Interactive Zero-Knowledge Proofs for Composite Statements
Non-interactive zero-knowledge sigma protocols SNARK
2018/6/5
The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for proving algebraic statements while...
Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution
Zero-knowledge proofs succinct arguments of knowledge TinyRAM
2018/5/2
There have been tremendous advances in reducing interaction, communication and verification time in zero-knowledge proofs but it remains an important challenge to make the prover efficient. We constru...
On the Existence of Three Round Zero-Knowledge Proofs
zero-knowledge round complexity lower bound
2018/3/6
In this work, we study the feasibility of ZK proofs using non-black-box simulation. Our main result is that three round private-coin ZK proofs for NP do not exist (even w.r.t. non-black-box simulation...
Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives
privacy-preserving cryptography provable security accumulator
2017/11/29
In this paper we address the construction of privacy-friendly cryptographic primitives for the post-quantum era and in particular accumulators with zero-knowledge membership proofs and ring signatures...