TOWARDS A STRONG COMMUNICATION COMPLEXITY THEORY OR GENERATING QUASI-RANDOM SEQUENCES FROM TWO COMMUNICATING SLIGHTLY-RANDOM SOURCES.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1985, Pages 366-378

  Vazirani, Umesh V ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

COMMUNICATION COMPLEXITY; CRYPTOGRAPHIC PROTOCOLS; QUASI-RANDOM SEQUENCES; SLIGHTLY RANDOM SOURCES;

MATHEMATICAL STATISTICS;

EID: 0021901103     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/22145.22186     Document Type: Conference Paper

References (18)