Results 1  10
of
110,799
Tight Parallel Repetition Theorems for Publiccoin Arguments
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 109
, 2009
"... Following Hastad et al. [HPPW08], we study parallel repetition theorems for publiccoin interactive arguments and their generalizations. We obtain the following results: 1. We show that the reduction of Hastad et al. [HPPW08] actually gives a tight direct product theorem for publiccoin interactive ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Following Hastad et al. [HPPW08], we study parallel repetition theorems for publiccoin interactive arguments and their generalizations. We obtain the following results: 1. We show that the reduction of Hastad et al. [HPPW08] actually gives a tight direct product theorem for publiccoin interactive
Tight Parallel Repetition Theorems for Publiccoin Arguments
, 2009
"... Following Hastad et al. [HPPW08], we study parallel repetition theorems for publiccoin interactive arguments and their generalizations. We obtain the following results: 1. We show that the reduction of Hastad et al. [HPPW08] actually gives a tight direct product theorem for publiccoin interactive ..."
Abstract
 Add to MetaCart
Following Hastad et al. [HPPW08], we study parallel repetition theorems for publiccoin interactive arguments and their generalizations. We obtain the following results: 1. We show that the reduction of Hastad et al. [HPPW08] actually gives a tight direct product theorem for publiccoin interactive
A Parallel Repetition Theorem
 SIAM Journal on Computing
, 1998
"... We show that a parallel repetition of any twoprover oneround proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previously known. The constant in the exponent (in our analysis) depends only on the original probability of error and on the t ..."
Abstract

Cited by 378 (9 self)
 Add to MetaCart
We show that a parallel repetition of any twoprover oneround proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previously known. The constant in the exponent (in our analysis) depends only on the original probability of error
PublicCoin Parallel ZeroKnowledge for NP
, 2011
"... We show that, assuming the existence of collisionresistant hash functions, every language in NP has a constantround publiccoin zeroknowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak’s zeroknowledge arg ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show that, assuming the existence of collisionresistant hash functions, every language in NP has a constantround publiccoin zeroknowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak’s zero
Parallel repetition theorems for interactive arguments
 Electronic Colloquium on Computational Complexity (ECCC
"... Abstract. We study efficient parallel repetition theorems for several classes of interactive arguments and obtain the following results: 1. We show a tight parallel repetition theorem for publiccoin interactive arguments by giving a tight analysis for a reduction algorithm of H˚astad et al. [HPPW08 ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. We study efficient parallel repetition theorems for several classes of interactive arguments and obtain the following results: 1. We show a tight parallel repetition theorem for publiccoin interactive arguments by giving a tight analysis for a reduction algorithm of H˚astad et al. [HPPW
On the Composition of PublicCoin ZeroKnowledge Protocols
 In CYPTO, Springer LNCS 5677
, 2009
"... Abstract. We show that only languages in BPP have publiccoin, blackbox zeroknowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. This result holds both in the plain model (without any setup) and in the Bare PublicKey Model (where the prover and the v ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Abstract. We show that only languages in BPP have publiccoin, blackbox zeroknowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. This result holds both in the plain model (without any setup) and in the Bare PublicKey Model (where the prover
Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora
, 1997
"... ..."
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
A Perspective on Psychology and Economics
, 2001
"... This essay provides a perspective on the trend towards integrating psychology into economics. Some topics are discussed, and arguments are provided for why movement towards greater psychological realism in economics will improve mainstream economics. ..."
Abstract

Cited by 756 (10 self)
 Add to MetaCart
This essay provides a perspective on the trend towards integrating psychology into economics. Some topics are discussed, and arguments are provided for why movement towards greater psychological realism in economics will improve mainstream economics.
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
, 1990
"... Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not enjoy, i.e. monotonicity. We study here general patterns of ..."
Abstract

Cited by 624 (14 self)
 Add to MetaCart
of view are developed in parallel. The former point of view was pioneered by D. Gabbay in [10], while the latter has been advocated by Y. Shoham in [38]. Five such families are defined and characterized by representation theorems, relating the two points of view. One of the families of interest
Results 1  10
of
110,799