Boaz Barak, Oded Goldreich  Home/Search
Context Related
| iacr.org/2001/105.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2001/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We put forward a new type of computationally-sound proof systems, called universal-arguments, which are related but different from both CS-proofs (as defined by Micali) and arguments (as defined by Brassard, Chaum and Crepeau). In particular, we adopt the instance-based proverefficiency paradigm of CS-proofs, but follow the computational-soundness condition of argument systems (i.e., we consider only cheating strategies that are implementable by polynomial-size circuits) . We show that... (Update)
Cited by: More
Searchable Symmetric Encryption: Improved.. - Curtmola, Garay.. (2006) (Correct)
Zero Knowledge and Soundness are Symmetric - Shien Jin Ong (Correct)
On Expected Probabilistic Polynomial-Time Adversaries: - Suggestion For Restricted (2006) (Correct)
Similar documents (at the sentence level):
57.9%: Universal Arguments and their Applications - Barak, Goldreich (2001) (Correct)
Active bibliography (related documents): More All
0.3: Games, Complexity Classes, and Approximation Algorithms - Feigenbaum (1998) (Correct)
0.2: Zero-Knowledge twenty years after its invention - Goldreich (2002) (Correct)
0.1: Alternation in Interaction - Kiwi, Lund, Russell, Spielman.. (1994) (Correct)
Similar documents based on text: More All
0.5: The GGM Construction does NOT yield Correlation Intractable.. - Goldreich (2002) (Correct)
0.4: How to Go Beyond the Black-Box Simulation Barrier - Barak (2001) (Correct)
0.4: Strict Polynomial-time in Simulation and Extraction - Barak, Lindell (2002) (Correct)
Related documents from co-citation: More All
10: How to Go Beyond the Black-Box Simulation Barrier - Barak - 2001
9: Concurrent Zero Knowledge - Dwork, Naor et al.
7: Strict polynomial-time in simulation and extraction - Barak, Lindell - 2001
BibTeX entry: (Update)
Boaz Barak and Oded Goldreich. Universal arguments and their applications. In preparation, 2001. http://citeseer.ist.psu.edu/article/barak01universal.html More
@article{ barak01universal,
author = "Boaz Barak and Oded Goldreich",
title = "Universal Arguments and their Applications ",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
number = "093",
year = "2001",
url = "citeseer.ist.psu.edu/article/barak01universal.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al.
242 Non-Deterministic Exponential Time has TwoProver Interactive.. - Babai, Fortnow et al.
203 Approximating Clique is almost NP-complete (context) - Feige, Goldwasser et al.
196 Minimum Disclosure Proofs of Knowledge (context) - Brassard, Chaum et al.
194 Proofs that Yield Nothing but their Validity or All Language.. (context) - Goldreich, Micali et al.
173 Proof Verification and Intractability of Approximation Probl.. (context) - Arora, Lund et al.
173 Trading Group Theory for Randomness (context) - Babai - 1985
172 Algebraic Methods for Interactive Proof Systems - Lund, Fortnow et al.
167 The Random Oracle Methodology (context) - Canetti, Goldreich et al. - 1998
155 Checking Computations in Polylogarithmic Time - Babai, Fortnow et al. - 1991
99 Foundation of Cryptography -- Basic Tools (context) - Goldreich - 2001
95 Multiple Non-Interactive Zero-Knowledge Proofs Under General.. (context) - Feige, Lapidot et al. - 1999
93 the power of multi-prover interactive protocols - Fortnow, Rompel et al. - 1988
83 Multi-Prover Interactive Proofs: How to Remove Intractabilit.. (context) - Ben-Or, Goldwasser et al. - 1988
69 Zero-Knowledge Proofs of Knowledge in Two Rounds (context) - Feige, Shamir - 1990
58 On Defining Proofs of Knowledge - Bellare, Goldreich
56 How to Go Beyond the Black-Box Simulation Barrier - Barak - 2001
39 Probabilistic Checkable Proofs: A New Characterization of NP (context) - Arora, Safra
35 A Note on Efficient Zero-Knowledge Proofs and Arguments (context) - Kilian - 1992
31 Everything Provable is Provable in Zero-Knowledge (context) - Ben-Or, Goldreich et al. - 1990
16 Computationally Sound Proofs (context) - Micali
6 The noisy oracle problem (context) - Feige, Shamir et al.
3 Making games short (context) - Feige, Kilian - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/2001/): More
Quasi-Efficient Revocation of Group Signatures - Ateniese, Tsudik (2001) (Correct)
An Extended Quadratic Frobenius Primality Test with.. - Damgård, Frandsen (2001) (Correct)
Countermeasures against Side-Channel Attacks for Elliptic Curve.. - Bellezza (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC