搜索结果: 1-8 共查到“军事学 Non-interactive zero-knowledge proofs”相关记录8条 . 查询时间(0.196 秒)
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...
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...
Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge
Zero-knowledge proofs, Non-interactive proofs
2017/10/30
We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge proofs (DVNIZK) for a wide class of algebraic languages over abelian groups, under standard assumpt...
Non-interactive zero-knowledge proofs in the quantum random oracle model
Quantum cryptography proofs of knowledge random oracles
2016/1/8
We present a construction for non-interactive zero-knowledge proofs of knowledge in the random
oracle model from general sigma-protocols. Our construction is secure against quantum adversaries.
Prio...
Non-Interactive Zero-Knowledge Proofs of Non-Membership
Zero Knowledge Witness Elimination Smooth Projective Hash Function
2016/1/4
Often, in privacy-sensitive cryptographic protocols, a party commits to a secret message m and later needs to prove
that m belongs to a language L or that m does not belong to L (but does not want to...
Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
Non-interactive zero-knowledge proofs fully homomorphic encryption
2011/1/12
A non-interactive zero-knowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that non-interact...
Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
foundations / Non-interactive zero-knowledge proofs fully homomorphic encryption
2012/3/30
A non-interactive zero-knowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that non-interact...