搜索结果: 106-120 共查到“军事学 Zero-knowledge”相关记录198条 . 查询时间(0.083 秒)
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation
Concurrent ZK Constant-Round Indistinguishability Obfuscation
2016/1/5
We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol
relies on the existence of families of collision-resistant hash functions, one-way permutations,
and indistinguish...
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...
Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists
Zero-knowledge argument discrete logarithm polynomial evaluation
2016/1/3
Verification of a polynomial’s evaluation in a secret committed value plays a role in cryptographic applications such as non-membership or membership proofs. We construct a novel special honest verifi...
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
hash proof systems zero-knowledge malicious adversaries
2016/1/3
We introduce implicit zero-knowledge arguments (iZK) and simulation-sound variants thereof
(SSiZK); these are lightweight alternatives to zero-knowledge arguments for enforcing semi-honest behavior.
...
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...
We show new constructions of secret-sharing schemes with efficient sharing and reconstruction for access structures that are in \P, but are not known to be in \NC, namely Bounded-Degree Graph Isomorph...
Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data
network data privacy cloud security fully dynamic zero-knowledge updates
2015/12/31
We show how to provide privacy-preserving (zero-knowledge) answers to order queries on
network data that is organized in lists, trees, and partially-ordered sets of bounded dimension.
Our methods ar...
Large computations, when amenable to distributed parallel execution, are often executed on computer clusters,
for scalability and cost reasons. Such computations are used in many applications, includ...
Zero-Knowledge Accumulators and Set Operations
zero-knowledge accumulators cryptographic accumulators secure set-operations
2015/12/31
Accumulators provide a way to succinctly represent a set with elements drawn from a given domain, using
an accumulation value. Subsequently, short proofs for the set-membership (or non-membership) of...
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...
Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost
zero-knowledge secure computation oblivious ram
2015/12/30
We describe a zero-knowledge proof system in which a prover holds a large dataset M and can
repeatedly prove NP relations about that dataset. That is, for any (public) relation R and x, the
prover c...
Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions
concurrent non-malleable zero-knowledge one-way function
2015/12/29
Concurrent non-malleable zero-knowledge (CNMZK) protocols are zero-knowledge protocols that provides security even when adversaries interacts with multiple provers and verifiers simultaneously. It is ...
Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage
Leakage Resilience Bounded Retrieval Model Proof of Storage
2015/12/22
We provide a framework for constructing leakage-resilient identification (ID) protocols in
the bounded retrieval model (BRM) from proofs of storage (PoS) that hide partial information
about the file...
Zero-Knowledge Interactive Proof Systems for New Lattice Problems
Zero-Knowledge Interactive Proof Systems Isometric Latties
2015/12/22
In this work we introduce a new hard problem in lattices called Isometric Lattice Problem (ILP) and reduce Linear Code Equivalence over prime fields and Graph Isomorphism to this prob- lem. We also sh...
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
Zero-Knowledge Probabilisticaly Checkable Proofs Leakage-Resilience
2015/12/21
A Probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form ``$x\in L$'' by querying onl...