Linear zero-knowledge - a note on efficient zero-knowledge proofs and arguments

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 436-445

  Cramer, Ronald ^a   Damgard, Ivan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL LINGUISTICS; NETWORK PROTOCOLS; POLES AND ZEROS; PROBABILITY; THEOREM PROVING;

BIT COMMITMENTS; COMMUNICATION COMPLEXITY; ZERO-KNOWLEDGE PROOF SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0030679475     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258635     Document Type: Conference Paper

References (29)