COMPLETENESS THEOREM FOR PROTOCOLS WITH HONEST MAJORITY.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1987, Pages 218-229

  Goldreich, Oded ^a   Micali, Silvio ^a   Wigderson, Avi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

COMPLETENESS THEOREM; POLYNOMIAL-TIME ALGORITHM; PROTOCOLS WITH HONEST MAJORITY;

CRYPTOGRAPHY;

EID: 0023545076     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)