Results 1  10
of
263,145
ConstantRound Concurrent Zero Knowledge in the Bounded Player Model
"... Abstract. In [18] Goyal et al. introduced the bounded player model for secure computation. In the bounded player model, there are an a priori bounded number of players in the system, however, each player may execute any unbounded (polynomial) number of sessions. They showed that even though the mod ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
“straightline” simulator. We note that this constitutes the strongest result known on constantround concurrent zero knowledge in the plain model (under well accepted relaxations) and subsumes Barak’s constantround bounded concurrent zeroknowledge result. We view this as a positive step towards getting
On ConstantRound Concurrent ZeroKnowledge
"... Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient ” verifier can be “efficiently” simulated. An outstanding open question regarding zeroknowledge is whether constantround concurrent zeroknowledge proofs exists for nontrivial languages. We ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient ” verifier can be “efficiently” simulated. An outstanding open question regarding zeroknowledge is whether constantround concurrent zeroknowledge proofs exists for nontrivial languages
ConstantRound Concurrent Zeroknowledge from
, 2014
"... We present a constantround concurrent zeroknowledge protocol for NP. Our protocol relies on the existence of families of collisionresistant hash functions, oneway permutations, and indistinguishability obfuscators for P/poly (with slightly superpolynomial security). ..."
Abstract
 Add to MetaCart
We present a constantround concurrent zeroknowledge protocol for NP. Our protocol relies on the existence of families of collisionresistant hash functions, oneway permutations, and indistinguishability obfuscators for P/poly (with slightly superpolynomial security).
Constantround concurrent zero knowledge from falsifiable assumptions
, 2012
"... We present a constantround concurrent zeroknowledge protocol for NP. Our protocol is sound against uniform polynomialtime attackers, and relies on the existence of families of collisionresistant hash functions, and a new (but in our eyes, natural) falsifiable intractability assumption: Roughly s ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
We present a constantround concurrent zeroknowledge protocol for NP. Our protocol is sound against uniform polynomialtime attackers, and relies on the existence of families of collisionresistant hash functions, and a new (but in our eyes, natural) falsifiable intractability assumption: Roughly
On ConstantRound Concurrent ZeroKnowledge from a Knowledge Assumption
, 2012
"... In this work, we consider the longstanding open question of constructing constantround concurrent zeroknowledge protocols in the plain model. Resolving this question is known to require nonblackbox techniques. We consider nonblackbox techniques for zeroknowledge based on knowledge assumption ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this work, we consider the longstanding open question of constructing constantround concurrent zeroknowledge protocols in the plain model. Resolving this question is known to require nonblackbox techniques. We consider nonblackbox techniques for zeroknowledge based on knowledge
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing
ConstantRound Oblivious Transfer in the Bounded Storage Model
, 2004
"... We present a constant round protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties interacts based on a small portion of R. Even though the portions stored by the honest parties are small, sec ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
We present a constant round protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties interacts based on a small portion of R. Even though the portions stored by the honest parties are small
ConstantRound ConcurrentlySecure rZK with (Real) Bare PublicKeys
 Electronic Colloquium on Computational Complexity
"... We present constantround concurrently secure (sound) resettable zeroknowledge (rZKCS) arguments in the bare publickey (BPK) model. Our constructions deal with general NP ZKarguments as well as with highly ecient ZKarguments for numbertheoretic languages, most relevant to identi cation scena ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present constantround concurrently secure (sound) resettable zeroknowledge (rZKCS) arguments in the bare publickey (BPK) model. Our constructions deal with general NP ZKarguments as well as with highly ecient ZKarguments for numbertheoretic languages, most relevant to identi cation
Knowledge and Common Knowledge in a Distributed Environment
 Journal of the ACM
, 1984
"... : Reasoning about knowledge seems to play a fundamental role in distributed systems. Indeed, such reasoning is a central part of the informal intuitive arguments used in the design of distributed protocols. Communication in a distributed system can be viewed as the act of transforming the system&apo ..."
Abstract

Cited by 577 (55 self)
 Add to MetaCart
: Reasoning about knowledge seems to play a fundamental role in distributed systems. Indeed, such reasoning is a central part of the informal intuitive arguments used in the design of distributed protocols. Communication in a distributed system can be viewed as the act of transforming the system
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Results 1  10
of
263,145