Definitions and properties of zero-knowledge proof systems (Q1324756): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Statistical zero-knowledge languages can be recognized in two rounds / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relativized perfect zero knowledge is not BPP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum disclosure proofs of knowledge / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3729902 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4038698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic encryption / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The knowledge complexity of interactive proof-systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank | |||
Normal rank |
Latest revision as of 15:17, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Definitions and properties of zero-knowledge proof systems |
scientific article |
Statements
Definitions and properties of zero-knowledge proof systems (English)
0 references
24 July 1994
0 references
computational complexity
0 references
computational indistinguishability
0 references
cryptographic composition of protocols
0 references
zero-knowledge proofs
0 references
auxiliary- input
0 references
blackbox-simulation
0 references