1989•Lecture notes in computer scienceRequires access

Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds

Gilles Brassard, Claude Crépeau, Moti Yung

Open publisher page 36 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 36 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Gas meter prover, Zero-knowledge proof, Discrete logarithm, Computer science, Bounded function, Discrete mathematics, Commitment scheme, Mathematical proof

Back to paper search Browse research topics Original source

Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds — Research Paper | ScholarLens