Secure computation with honest-looking parties: What if nobody is truly honest?

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 255-264

  Canetti, Ran ^a   Ostrovsky, Rafail ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DATA PRIVACY; FUNCTIONS; NETWORK PROTOCOLS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS); SECURITY OF DATA;

CRYPTOGRAPHIC PROTOCOLS; SECURE MULTI-PARTY COMPUTATIONS;

ALGORITHMS;

EID: 0032687056     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (30)