搜索结果: 1-8 共查到“军事学 Zero-Knowledge Proofs of Knowledge”相关记录8条 . 查询时间(0.125 秒)
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...
Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
cryptographic protocols zero-knowledge proofs
2016/1/3
Since their introduction in 1985, by Goldwasser, Micali and Rackoff, followed by Feige, Fiat
and Shamir, zero-knowledge proofs have played a significant role in modern cryptography: they allow a
par...
Constant-Round Zero-Knowledge Proofs of Knowledge
zero-knowledge proofs proofs of knowledge constant number of rounds
2011/1/5
In this note, we show the existence of \emph{constant-round} computational zero-knowledge \emph{proofs of knowledge} for all $\NP$. The existence of constant-round zero-knowledge proofs was proven by ...
A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality
Zero-Knowledge Proofs Knowledge and the ZKPOK Ideal Functionality
2010/11/2
In this note, we provide a formal proof of the fact that any protocol that is a zero-knowledge proof of knowledge for a relation $R$ is also a secure protocol for the zero-knowledge proof of knowledge...
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on $\Sigma$-Protocols
implementation Zero-Knowledge Protocol Compiler Formal Verification
2010/7/14
Zero-knowledge proofs of knowledge (ZK-PoK) are important building blocks for numerous cryptographic applications. Although ZK-PoK have very useful properties, their real world deployment is typically...
Bringing Zero-Knowledge Proofs of Knowledge to Practice
Bringing Zero-Knowledge Proofs DAA TCG
2009/6/12
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are
basic building blocks of many practical cryptographic applications such
as identification schemes, group signatures, and secure multiparty c...
Round-Optimal Zero-Knowledge Proofs of Knowledge for NP
Round-Optimal Zero-Knowledge Proofs NP Hamiltonian Cycle
2009/6/10
It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are nonconstant-
round. Whether there exit constant-round black-box zero-knowledge proofs of knowledge for
all...
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
Efficient Zero-Knowledge Proofs Intractability Assumptions
2009/4/17
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions.