搜索结果: 121-135 共查到“军事学 zero knowledge”相关记录198条 . 查询时间(0.151 秒)
Witness Signatures and Non-Malleable Multi-Prover Zero-Knowledge Proofs
Witness Based Cryptography Multi-Prover Interactive Proofs
2015/12/21
Motivated by the goal of removing trusted setup assumptions from cryptography, we introduce the
notion of witness signatures. This primitive allows any party with a valid witness to an NP statement t...
Authenticated Range \& Closest Point Queries in Zero-Knowledge
Authenticated Range Closest Point Queries
2015/12/18
We present an efficient method for answering one-dimensional range and closest-point
queries in a verifiable and privacy-preserving manner. We consider a model where a data owner outsources
a datase...
Efficient Statistical Zero-Knowledge Authentication Protocols for Smart Cards Secure Against Active & Concurrent Quantum Attacks
Authentication Smart Cards
2014/3/6
In this paper, we construct two statistical zero-knowledge authentication protocols for smart cards based on general assumptions. The first protocol can only resist active attacks, where the smart car...
Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
Concurrent Zero Knowledge Non-black-box Simulation
2014/3/6
As recent studies show, the notions of *program obfuscation* and *zero knowledge* are intimately connected. In this work, we explore this connection further, and prove the following general result. If...
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
succinct arguments zero-knowledge
2014/3/10
An argument system for NP is a proof system that allows efficient verification of NP statements, given proofs produced by an untrusted yet computationally-bounded prover. Such a system is non-interact...
The notion of \emph{zero-knowledge} \cite{GMR85} is formalized by requiring that for every malicious efficient verifier $V^*$, there exists an efficient simulator $S$ that can reconstruct the view of ...
Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
Circuit-SAT linear error-correcting codes non-interactive zero knowledge polynomial algebra
2013/4/18
Recently, Gennaro, Gentry, Parno and Raykova~\cite{eprint2012:GennaroGPR} proposed an efficient non-interactive zero knowledge argument for Circuit-SAT, based on non-standard notions like conscientiou...
Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently
Zero-knowledge Garbled Circuits Secure Two-Party Computation Active Security
2013/4/18
Zero-knowledge protocols are one of the fundamental concepts in modern cryptography and have countless applications. However, after more than 30 years from their introduction, there are only very few ...
Lightweight Zero-Knowledge Proofs for Crypto-Computing Protocols
public-key cryptography Universal composability conditional disclosure of secrets
2013/2/21
Abstract: Crypto-computing is a set of well-known techniques for computing with encrypted data. The security of the corresponding protocols are usually proven in the semi-honest model. In this work, w...
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
foundations / Zero-knowledge protocol concurrent non-malleability
2012/6/14
A zero-knowledge protocol allows a prover to convince a verifier the correctness of a statement without disclosing any other information to the verifier. It is a basic tool and widely used in many oth...
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
foundations / Zero-knowledge protocol concurrent non-malleability adaptive corruption commitment schemes
2012/3/22
A zero-knowledge protocol allows a prover to convince a verifier the correctness of a statement without disclosing any other information to the verifier. It is a basic tool and widely used in many oth...
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
foundations / Zero-knowledge protocol concurrent non-malleability adaptive corruption commitment schemes
2012/3/21
A zero-knowledge protocol allows a prover to convince a verifier the correctness of a statement without disclosing any other information to the verifier. It is a basic tool and widely used in many oth...
From Point Obfuscation To 3-round Zero-Knowledge
cryptographic protocols / Zero-Knowledge Obfuscation Point Obfuscation Witness-Hiding
2012/3/26
We construct 3-round proofs and arguments with negligible soundness error satisfying two relaxed notions of {\em zero-knowledge}: {\em Weak ZK} and {\em witness hiding} (WH). At the heart of our const...
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...
Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
foundations / Non-malleability zero knowledge commitments black-box constructions
2012/3/26
This paper deals with efficient non-malleable zero-knowledge proofs for NP, based on general assumptions. We construct a simulation-sound zero-knowledge protocol for NP, based only on the black-box us...