No label defined (Q3816074)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4087662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4087662 |
Statements
1988
0 references
randomness
0 references
resource-bounded computation
0 references
zero-knowledge proofs
0 references
cryptography
0 references
0.8625474572181702
0 references
0.8333704471588135
0 references
0.8285766839981079
0 references
0.8285766839981079
0 references
[For the entire collection see Zbl 0648.00002.] New approaches to randomness and proof are surveyed. These approaches are based on the theory of resource-bounded computation. The new proof-notion allows the introduction of ``zero-knowledge proofs''. First some basic notions as: deterministic, nondeterministic, and probabilistic polynomial-time computations are defined and discussed. Also a recent behavioristic approach to randomness is surveyed. In the following two chapters, ``interactive'' and ``zero-knowledge'' proofs are considered. Discussions, examples and applications (... to cryptography) round off the exposition. For the theorems, the author gives ``proof ideas''; at the end, bibliographic notes and references are added.
0 references