搜索结果: 151-165 共查到“军事学 zero knowledge”相关记录198条 . 查询时间(0.277 秒)
A New Scheme for Zero Knowledge Proof based on Multivariate Quadratic Problem and Quaternion Algebra
Multivariate Quadratic Quaternion Zero Knowledge Proof Authentication
2010/2/20
This paper introduces a new intractable security problem whose
intractability is due to the NP completeness of multivariate quadratic problem. This
novel problem uses quaternion algebra in conjuncti...
Interactive Locking，Zero-Knowledge PCPs，and Unconditional Cryptography
Cryptography Statistical Security Zero Knowledge Interactive Proof InteractivePCP Commitment Scheme Oblivious Transfer Interactive Hashing
2010/3/16
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hard-
ware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs for NP.
We show tha...
Composition of Zero-Knowledge Proofs with Efficient Provers
Zero-Knowledge Proofs Efficient Provers
2009/12/29
We revisit the composability of different forms of zero-knowledge proofs when the honest
prover strategy is restricted to be polynomial time (given an appropriate auxiliary input).
Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
Zero-Knowledge Precise Zero-Knowledge Concurrent Zero-Knowledge
2009/9/27
Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. [23] in
Eurocrypt'08 (which generalizes the work on precise zero-knowledge by Micali and Pass [19] in
STOC'06). This not...
Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
Zero-Knowledge Precise Zero-Knowledge Concurrent Zero-Knowledge Interactive Proofs and Arguments
2009/9/22
Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. [23] in
Eurocrypt'08 (which generalizes the work on precise zero-knowledge by Micali and Pass [19] in
STOC'06). This not...
Precise Time and Space Simulatable Zero-Knowledge
Zero-Knowledge Precise Zero-Knowledge Proofs of Knowledge
2009/9/11
Traditionally, the definition of zero-knowledge states that an interactive proof of x 2 L
provides zero (additional) knowledge if the view of any polynomial-time verifier can be recon-
structed by a...
Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments
Sub-linear size non-interactive zero-knowledge arguments circuit satisfiability pairing-based cryptography
2009/8/18
We construct non-interactive zero-knowledge arguments for circuit satisfiability and arithmetic circuits
with perfect completeness, perfect zero-knowledge and computational (co-)soundness. The non-in...
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
Adaptive Zero-Knowledge Proofs Adaptively Secure Oblivious Transfer
2009/8/7
In the setting of secure computation, a set of parties wish to securely compute some function
of their inputs, in the presence of an adversary. The adversary in question may be static
(meaning that ...
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...
Resettably-Sound Resettable Zero Knowledge Arguments for NP
Resettably-Sound Resettable Zero Knowledge Arguments NP non-black-box
2009/6/11
We construct resettably-sound resettable zero knowledge arguments for NP based
on standard hardness assumption (the existence of claw-free permutations) in the plain model.
This proves the simultane...
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...
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...
Identification and Privacy: Zero-Knowledge is not Enough
Identification Privacy: Zero-Knowledge
2009/6/4
At first glance, privacy and zero-knowledgeness seem to be
similar properties. A scheme is private when no information is revealed
on the prover and in a zero-knowledge scheme, communications should...
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers
Computational Soundness Symbolic Zero-Knowledge Proofs Active Attackers
2009/6/3
The abstraction of cryptographic operations by term algebras,
called Dolev-Yao models, is essential in almost all
tool-supported methods for proving security protocols. Recently
significant progres...
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
cryptography computational complexity noninteractive zero-knowledge proofs
2009/6/2
We show that interactive and noninteractive zero-knowledge are equivalent in the `help
model' of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference
string is generated b...