搜索结果: 1-11 共查到“军事学 Zero-Knowledge Protocols”相关记录11条 . 查询时间(0.084 秒)
We consider natural ways to extend the notion of Zero-Knowledge (ZK) Proofs beyond decision problems. Specifically, we consider search problems, and define zero-knowledge proofs in this context as int...
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems
Efficient Commitments Zero-Knowledge Protocols
2016/12/8
We present an additively homomorphic commitment scheme
with hardness based on the Ring-SIS problem. Our construction is statistically
hiding as well as computationally binding and allows to commit
...
On the Amortized Complexity of Zero-knowledge Protocols
Σ-protocols zero-knowledge proof of knowledge
2015/12/30
We propose a general technique that allows improving the complexity of zero-knowledge
protocols for a large class of problems where previously the best known solution was a simple cut-andchoose
styl...
Milder Definitions of Computational Approximability: The Case of Zero-Knowledge Protocols
foundations / Approximability Indistinguishability Zero Knowledge Random Oracle Trapdoor One-Way Permutation Sequential Composition
2012/3/26
Many cryptographic primitives---such as pseudorandom generators, encryption schemes, and zero-knowledge proofs---center around the notion of \emph{approximability}. For instance, a pseudorandom genera...
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
cryptographic protocols
2011/7/25
We present a protocol that allows to prove in zero-knowledge that committed values $x_i, y_i, z_i$, $i=1,\dots,l$ satisfy $x_iy_i=z_i$, where the values are taken from a finite field $K$, or are integ...
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
cryptographic protocols
2012/3/28
We present a protocol that allows to prove in zero-knowledge that committed values $x_i, y_i, z_i$, $i=1,\dots,l$ satisfy $x_iy_i=z_i$, where the values are taken from a finite field $K$, or are integ...
A Framework for Practical Universally Composable Zero-Knowledge Protocols
cryptographic protocols / Universal Composability Protocol Design Zero-Knowledge Proof of Knowledge
2012/3/28
Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. At \emph{Eurocrypt 2009}, Camenisch, Kiayias, and Yung...
A Framework for Practical Universally Composable Zero-Knowledge Protocols
cryptographic protocols / Universal Composability Protocol Design Zero-Knowledge Proof of Knowledge
2011/6/8
Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. At \emph{Eurocrypt 2009}, Camenisch, Kiayias, and Yung...
Automatic Generation of Sound Zero-Knowledge Protocols
Zero-Knowledge Protocol Compiler Language Design
2009/6/10
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...
Strengthening Zero-Knowledge Protocols using Signatures
Strengthening Zero-Knowledge Protocols Signatures
2009/4/8
Strengthening Zero-Knowledge Protocols using Signatures.
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
Knowledge-of-Exponent Assumptions 3-Round Zero-Knowledge Protocols
2009/3/20
Hada and Tanaka [11, 12] showed the existence of 3-round, negligible-error zero-knowledge
arguments for NP based on a pair of non-standard assumptions, here called KEA1 and KEA2. In
this paper we sh...