Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

STACS
1991
Springer

favoriteEmaildiscussreport

92views Theoretical Computer Science» more STACS 1991»

Computationally Convincing Proofs of Knowledge

13 years 8 months ago

Computationally Convincing Proofs of Knowledge

Download crypto.cs.mcgill.ca

Gilles Brassard, Claude Crépeau, Sophie Lap

Real-time Traffic

STACS 1991 | Theoretical Computer Science |

claim paper

Related Content

» Quantum Interactive Proofs with Competing Provers

» ZeroKnowledge Watermark Detection and Proof of Ownership

» Upper Bounds for Quantum Interactive Proofs with Competing Provers

» Unifying ZeroKnowledge Proofs of Knowledge

» Increasing the Power of the Dealer in Noninteractive ZeroKnowledge Proof Systems

» An Unconditional Study of Computational Zero Knowledge

» On Defining Proofs of Knowledge in the Bare Public Key Model

» Generic Indifferentiability Proofs of Hash Designs

» ZeroKnowledge

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	STACS
Authors	Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger

Comments (0)