搜索结果: 181-195 共查到“军事学 zero knowledge”相关记录198条 . 查询时间(0.108 秒)
Concurrent Zero Knowledge without Complexity Assumptions
concurrent zero-knowledge proofs problem-dependent commitments quadratic residuosity
2009/2/26
We provide unconditional constructions of concurrent statistical zero-knowledge proofs for
a variety of non-trivial problems (not known to have probabilistic polynomial-time algorithms).
The problem...
Zero-Knowledge Proofs for Mix-nets of Secret Shares and a Version of ElGamal with Modular Homomorphism
Zero-Knowledge Proofs Mix-nets Secret Shares ElGamal Modular Homomorphism
2009/1/20
Mix-nets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving combinatorial problems where constraints depend on secrets of di erent particip...
Zero Knowledge and Soundness are Symmetric
zero-knowledge argument systems statistical zero knowledge complexity classes
2008/12/31
We give a complexity-theoretic characterization of the class of problems in NP having zeroknowledge argument systems. This characterization is symmetric in its treatment of the zero
knowledge and the...
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
Concurrent Statistical Zero-Knowledge Arguments NP One Way Functions
2008/12/29
In this paper we show a general transformation from any
honest veri¯er statistical zero-knowledge argument to a concurrent sta-
tistical zero-knowledge argument. Our transformation relies only ...
Concurrent Non-Malleable Zero Knowledge
Non-malleable protocols concurrent composition concurrent zero knowledge
2008/12/23
We provide the first construction of a concurrent and non-malleable zero knowledge argument for
every language in NP. We stress that our construction is in the plain model with no common random
stri...
An Efficient and Secure Two-flow Zero-Knowledge Identification Protocol
Two-flow Zero-Knowledge Identification Protocol
2008/12/22
An Efficient and Secure Two-flow Zero-Knowledge Identification Protocol.
Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model
Zero-Knowledge Protocols Concurrently Non-Malleability Public-Key Models
2008/12/17
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks
like the Internet: efficient zero-knowledge arguments of knowledge that remain se...
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption
Resettable Zero Knowledge Concurrent Soundness Bare Public-Key Model Resettably sound Zero Knowledge
2008/12/5
In this paper we resolve an open problem regarding resettable zero knowledge
in the bare public-key (BPK for short) model: Does there exist constant
round resettable zero knowledge argument with con...
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function
cryptography one-way functions zero-knowledge arguments
2008/11/25
We show that every language in NP has a statistical zero-knowledge argument system under
the (minimal) complexity assumption that one-way functions exist. In such protocols, even a
computationally u...
A Zero-Knowledge Identification and Key Agreement Protocol
mutual identification key agreement zero-knowledge
2008/9/5
In this paper, we propose a zero-knowledge authenticated key agreement protocol with key
confirmation (AKC) in asymmetric setting. The protocol has several desirable security attributes like some cla...
Verifying Statistical Zero Knowledge with Approximate Implementations
Verifying Statistical Zero Knowledge Approximate Implementations
2008/8/27
Statistical zero-knowledge (SZK) properties play an important
role in designing cryptographic protocols that enforce honest behavior
while maintaining privacy. This paper presents a novel approach
...
Which Languages Have 4-Round Zero-Knowledge Proofs
Languages 4-Round Zero-Knowledge Proofs
2008/8/18
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof
system with negligible soundness error, then L ∈ MA. Assuming the polynomial hierarchy
does not collapse, th...
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
Zero-Knowledge Applied Pi- Anonymous Attestation Protocol
2008/8/14
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol.
Isolated Proofs of Knowledge and Isolated Zero Knowledge
IPoK Isolated Zero Knowledge cheating prover
2008/5/29
We introduce a new notion called `-isolated proofs of knowledge (`-IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to ` bits of communication with some external...
Interactive and Noninteractive Zero Knowledge Coincide in the Help Model
cryptography computational complexity noninteractive zero-knowledge proofs
2008/5/26
We show that a problem in AM has a interactive zero-knowledge proof system if and only if it
has a noninteractive zero knowledge proof system in the ‘help model’ of Ben-Or and Gutfreund
(J. Cryptolo...