Results 1  10
of
160,598
SpringerVerlag, LNCS????, pages???–???. Implicit ZeroKnowledge Arguments and Applications to the Malicious Setting
"... Abstract. We introduce implicit zeroknowledge arguments (iZK) and simulationsound variants thereof (SSiZK); these are lightweight alternatives to zeroknowledge arguments for enforcing semihonest behavior. Our main technical contribution is a construction of efficient twoflow iZK and SSiZK proto ..."
Abstract
 Add to MetaCart
Abstract. We introduce implicit zeroknowledge arguments (iZK) and simulationsound variants thereof (SSiZK); these are lightweight alternatives to zeroknowledge arguments for enforcing semihonest behavior. Our main technical contribution is a construction of efficient twoflow iZK and SSi
Noninteractive ZeroKnowledge
 SIAM J. COMPUTING
, 1991
"... This paper investigates the possibility of disposing of interaction between prover and verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zeroknowledge proofs exist for some numbertheoretic languages for which ..."
Abstract

Cited by 216 (19 self)
 Add to MetaCart
This paper investigates the possibility of disposing of interaction between prover and verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zeroknowledge proofs exist for some numbertheoretic languages
Resettable zeroknowledge
, 2000
"... We introduce the notion of Resettable ZeroKnowledge (rZK), a new security measure for cryptographic protocols which strengthens the classical notion of zeroknowledge. In essence, an rZK protocol is one that remains zero knowledge even if an adversary can interact with the prover many times, each ..."
Abstract

Cited by 80 (6 self)
 Add to MetaCart
, each time resetting the prover to its initial state and forcing it to use the same random tape. All known examples of zeroknowledge proofs and arguments are trivially breakable in this setting. Moreover, by definition, all zeroknowledge proofs of knowledge are breakable in this setting. Under general
Concurrent ZeroKnowledge
 IN 30TH STOC
, 1999
"... Concurrent executions of a zeroknowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zeroknowledge in toto. In this paper, we study the problem of maintaining zeroknowledge We introduce the notion of an (; ) timing constraint: for any two proces ..."
Abstract

Cited by 177 (18 self)
 Add to MetaCart
interactive proofs and perfect concurrent zeroknowledge arguments for every language in NP . We also address the more specific problem of Deniable Authentication, for which we propose several particularly efficient solutions. Deniable Authentication is of independent interest, even in the sequential case
On Efficient ZeroKnowledge PCPs
"... Abstract. We revisit the question of ZeroKnowledge PCPs, studied by Kilian, Petrank, and Tardos (STOC ’97). A ZKPCP is defined similarly to a standard PCP, except that the view of any (possibly malicious) verifier can be efficiently simulated up to a small statistical distance. Kilian et al. obtai ..."
Abstract
 Add to MetaCart
Abstract. We revisit the question of ZeroKnowledge PCPs, studied by Kilian, Petrank, and Tardos (STOC ’97). A ZKPCP is defined similarly to a standard PCP, except that the view of any (possibly malicious) verifier can be efficiently simulated up to a small statistical distance. Kilian et al
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 1643 (75 self)
 Add to MetaCart
encryption, signatures, and zeroknowledge proofs.
Detection of Abrupt Changes: Theory and Application
 HTTP://PEOPLE.IRISA.FR/MICHELE.BASSEVILLE/KNIGA/
, 1993
"... ..."
Mercurial commitments with applications to zeroknowledge sets
 Advances in Cryptology—EUROCRYPT 2005
, 2005
"... Abstract. We introduce a new flavor of commitment schemes, which we call mercurial commitments. Informally, mercurial commitments are standard commitments that have been extended to allow for soft decommitment. Soft decommitments, on the one hand, are not binding but, on the other hand, cannot be in ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
be in conflict with true decommitments. We then demonstrate that a particular instantiation of mercurial commitments has been implicitly used by Micali, Rabin and Kilian to construct zeroknowledge sets. (Azeroknowledge set scheme allows a Prover to (1) commit to a set S in a way that reveals nothing about
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
and maximum stable set problems in perfect graphs, the maximum k partite subgraph problem in graphs, and va...
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 490 (21 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
Results 1  10
of
160,598