Results 1  10
of
3,020
LeakageResilient Zero Knowledge ∗
"... In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allowed to obtain arbitrary bounded leakage on the entire state (including the witness and the random coins) of the proverduring ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
) of the proverduring the entire protocol execution. We formalize a meaningful definition of leakageresilient zero knowledge (LRZK) proof system, that intuitively guarantees that the protocol does not yield anything beyond the validity of the statement and the leakage obtained by the verifier. We give a construction
Achieving Constant Round LeakageResilient ZeroKnowledge
"... Recently there has been a huge emphasis on constructing cryptographic protocols that maintain their security guarantees even in the presence of side channel attacks. Such attacks exploit the physical characteristics of a cryptographic device to learn useful information about the internal state of th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
is ⌈ n ϵ ⌉. In this work, we present the first construction of leakageresilient zeroknowledge satisfying the ideal requirement of ϵ = 0. While our focus is on a feasibility result for ϵ = 0, our construction also enjoys a constant number of rounds. At the heart of our construction is a new “public
ConstantRound LeakageResilient ZeroKnowledge Arguments of Knowledge for NP
, 2014
"... Garg, Jain, and Sahai first consider zero knowledge proofs in the presence of leakage on the local state of the prover, and present a leakageresilientzeroknowledge proof system for HC (Hamiltonian Cycle) problem. Their construction is called (1 + ε)leakageresilient zeroknowledge, for any con ..."
Abstract
 Add to MetaCart
constant ε> 0, because the total length of the leakage the simulator needs is (1 + ε) times as large as that of the leakage received by the verifier. In recent, Pandey provides a constantround leakageresilient zeroknowledge argument satisfying the ideal requirement of ε = 0. Whether there exist
Impossibility Results for LeakageResilient Zero Knowledge and MultiParty Computation
"... In [AGP14] Ananth et al. showed that continual leakageresilient nontransferable interactive proofs exist when a leakfree inputencoding phase is allowed and a common reference string is available. They left open the problem of removing the need of a common reference string. In [BGJK12] Boyle et a ..."
Abstract
 Add to MetaCart
questions. Our main contribution shows that leakageresilient blackbox zeroknowledge is impossible when relying on a leakfree inputencoding phase only (i.e., without CRS/preprocessing). Additionally, we also show that leakageresilient multiparty computation for all functionalities is impossible
LeakageResilient Identification Schemes from ZeroKnowledge Proofs of Storage∗
"... We provide a framework for constructing leakageresilient identification (ID) protocols in the bounded retrieval model (BRM) from proofs of storage (PoS) that hide partial information about the file. More precisely, we describe a generic transformation from any zeroknowledge PoS to a leakageresili ..."
Abstract
 Add to MetaCart
We provide a framework for constructing leakageresilient identification (ID) protocols in the bounded retrieval model (BRM) from proofs of storage (PoS) that hide partial information about the file. More precisely, we describe a generic transformation from any zeroknowledge PoS to a leakageresilient
The knowledge complexity of interactive proof systems

, 1989
"... Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltonian. In th ..."
Abstract

Cited by 1246 (39 self)
 Add to MetaCart
/nonHamiltonian. In this paper a computational complexity theory of the "knowledge " contained in a proof is developed. Zeroknowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zeroknowledge proof systems are given
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1646 (70 self)
 Add to MetaCart
encryption, signatures, and zeroknowledge proofs.
Proofs that Yield Nothing but Their Validity or All Languages in NP Have ZeroKnowledge Proof Systems
 JOURNAL OF THE ACM
, 1991
"... In this paper the generality and wide applicability of Zeroknowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without convey ..."
Abstract

Cited by 427 (43 self)
 Add to MetaCart
In this paper the generality and wide applicability of Zeroknowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 480 (20 self)
 Add to MetaCart
. The same concept makes sense in the contexts of string commitment and zeroknowledge proofs of possession of knowledge. Nonmalleable schemes for each of these three problems are presented. The schemes do not assume a trusted center; a user need not know anything about the number or identity of other
Making the Best of a Leaky Situation: ZeroKnowledge PCPs from LeakageResilient Circuits
"... 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 ∈ L ” by querying only few bits of the proof. A zeroknowledge PCP (ZKPCP) is a PCP with the additional guarantee that the vi ..."
Abstract
 Add to MetaCart
for compiling standard PCPs into ZKPCPs. Our approach is based on leakageresilient circuits, which are circuits that withstand certain “sidechannel ” attacks, in the sense that these attacks reveal nothing about the (properly encoded) input, other than the output. We observe that the verifier’s oracle queries
Results 1  10
of
3,020