|
Volumn Part F129722, Issue , 1992, Pages 723-732
|
A note on efficient zero-knowledge proofs and arguments
|
Author keywords
[No Author keywords available]
|
Indexed keywords
BIT COMMITMENT;
COMPLEXITY ASSUMPTIONS;
ERROR PROBABILITIES;
FIRST CONSTRUCTIONS;
INTERACTIVE PROOF SYSTEM;
INTERACTIVE PROOFS;
SECURITY PARAMETERS;
ZERO KNOWLEDGE PROOF;
COMPUTATION THEORY;
THEOREM PROVING;
COMPUTATIONAL COMPLEXITY;
ERROR STATISTICS;
FORMAL LANGUAGES;
ITERATIVE METHODS;
NETWORK PROTOCOLS;
PROBABILITY;
BASE INTERACTIVE PROOF SYSTEM;
ERROR PROBABILITY;
IDEAL BIT COMMITMENT MODEL;
ZERO KNOWLEDGE PROOFS;
|
EID: 0026963441
PISSN: 07378017
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/129712.129782 Document Type: Conference Paper |
Times cited : (430)
|
References (11)
|