搜索结果: 91-105 共查到“知识库 军事学 zero knowledge”相关记录196条 . 查询时间(0.042 秒)
Efficient Non-Interactive Zero Knowledge Arguments for Set Operations
Multisets non-interactive zero knowledge set operation arguments
2016/1/26
We propose a non-interactive zero knowledge pairwise multiset sum equality test (PMSET)
argument in the common reference string (CRS) model that allows a prover to show that the given
committed mult...
The notion of Zero Knowledge introduced by Goldwasser, Micali and Rackoff in STOC 1985
is fundamental in Cryptography. Motivated by conceptual and practical reasons, this notion has
been explored un...
Zero-Knowledge Password Policy Checks and Verifier-Based PAKE
Password policies password registration authentication
2016/1/23
Zero-Knowledge Password Policy Checks (ZKPPC), introduced in this work, enable blind registration of client passwords at remote servers, i.e., client passwords are never transmitted to the servers. ...
Black-Box Non-Black-Box Zero Knowledge
Black-box Constructions Non-black-box Simulation Input-size hiding
2016/1/9
Motivated by theoretical and practical interest, the challenging task of designing cryptographic
protocols having only black-box access to primitives has generated various breakthroughs
in the last ...
Zk-SNARKs (succinct non-interactive zero-knowledge arguments
of knowledge) are needed in many applications. Unfortunately,
all previous zk-SNARKs for interesting languages are either inefficient
fo...
Non-interactive zero-knowledge proofs in the quantum random oracle model
Quantum cryptography proofs of knowledge random oracles
2016/1/8
We present a construction for non-interactive zero-knowledge proofs of knowledge in the random
oracle model from general sigma-protocols. Our construction is secure against quantum adversaries.
Prio...
Scalable Zero Knowledge via Cycles of Elliptic Curves
computationally-sound proofs proof-carrying data zero knowledge
2016/1/8
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful
cryptographic primitive, both in theory and in practical applications. Recently, much research has focused
...
Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge
zero-knowledge garbled circuits
2016/1/8
In the last few years garbled circuits (GC) have been elevated from being merely a component
in Yao’s protocol for secure two-party computation, to a cryptographic primitive in its own right,
follow...
Verifiable Order Queries and Order Statistics on a List in Zero-Knowledge
order queries order statistics zero-knowledge
2016/1/7
Given a list L with n elements, an order query on L asks whether a given element x ∈ L precedes or
follows another element y ∈ L. More generally, given a set of m elements from L, an order query asks...
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
Constant Rounds Guaranteed Complexity
2016/1/7
The traditional setting for concurrent zero knowledge considers a server that proves a statement in
zero-knowledge to multiple clients in multiple concurrent sessions, where the server’s actions in a...
Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP
zero-knowledge proofs proofs of knowledge leakage-resilient
2016/1/7
Garg, Jain, and Sahai first consider zero knowledge proofs in the
presence of leakage on the local state of the prover, and present a leakageresilient-zero-knowledge
proof system for HC (Hamiltonian...
Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof
quantum bit commitment quantum zero-knowledge unconditional study
2016/1/6
Watrous (STOC 2006) proved that plugging classical bit commitment scheme that is secure
against quantum attack into the GMW-type construction of zero-knowledge gives a classical
zero-knowledge proof...
Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings
Commitment Schemes Ring Learning with Errors Zero-Knowledge Proofs of Knowledge
2016/1/6
We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge,
based on the learning with errors over rings (RLWE) problem. In particular, for rings in which almost all
...
Efficient Generic Zero-Knowledge Proofs from Commitments
cryptographic protocols Zero-knowledge commitments
2016/1/5
Even though Zero-knowledge has existed for more than 30 years, few generic constructions for Zero-knowledge exist. In this paper we present a new kind of commitment scheme on which we build a novel an...
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...