Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger  Home/Search
Context
Related
| cs.mcgill.ca/pub/theorique/...BCLL91.ps cs.mcgill.ca/pub/theoriq...BCLL91.ps.gz cs.mcgill.ca/~crepeau/GZ...BCLL91.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: cs.mcgill.ca/~crepe...proceedings (more) From: counterpane.com/b...allbyauthor (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we give a more general definition, which is capable of taking into account very adversarial behaviour from the prover. We also prove that constant-round arguments for NP-- (Update)
Active bibliography (related documents): More All
0.3: Subquadratic Zero-Knowledge - Boyar, Brassard, Peralta (1995) (Correct)
0.2: Statistical Secrecy and Multi-Bit Commitments - Damgård, Pedersen, Pfitzmann (1996) (Correct)
0.2: Constant-Round Perfect Zero-Knowledge Computationally.. - Brassard, Crépeau (1991) (Correct)
Similar documents based on text: More All
0.3: Quantum Amplitude Amplification and Estimation - Brassard, Høyer, Mosca, .. (2000) (Correct)
0.3: Sorting Out Zero-Knowledge - Brassard, CREPEAU (1990) (Correct)
0.3: Unconditionally Secure Commitment and Oblivious Transfer Schemes.. - Rivest (1999) (Correct)
BibTeX entry: (Update)
@misc{ brassard-computationally,
author = "Gilles Brassard and Claude Crépeau and Sophie Laplante and Christian Léger",
title = "Computationally convincing proofs of knowledge (Extended Abstract)",
url = "citeseer.ist.psu.edu/40931.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
206 Zero knowledge proofs of identity (context) - Feige, Fiat et al. - 1988
196 Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988
110 Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
70 The complexity of perfect zero-knowledge - Fortnow - 1987
41 Non-transitive transfer of confidence: A perfect zeroknowled.. - Brassard, Cr'epeau - 1986
23 Everything in NP can be argued in perfect zero-knowledge in .. - Brassard, Cr'epeau et al. - 1989
22 Demonstrating that a public predicate can be satisfied witho.. (context) - Chaum - 1987
8 the communication complexity of zeroknowledge proofs (context) - Boyar, Lund et al. - 1989
8 Sorting out zero-knowledge - Brassard, Cr'epeau
4 Random self-reducibility and zero-knowledge proofs of posses.. (context) - Tompa, Woll - 1987
1 Constant-round perfect zero-knowledge made easy (and efficie.. (context) - Brassard - 1990
Documents on the same site (http://www.cs.mcgill.ca/~crepeau/proceedings.html): More
A zero-knowledge Poker protocol that achieves confidentiality of.. - Crépeau (1986) (Correct)
Weakening Security Assumptions and Oblivious Transfer - Crépeau, al. (Correct)
Oblivious Transfers and Privacy Amplification - Brassard, Crépeau (1997) (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