Privacy and Communication Complexity
- 1 May 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 5 (2) , 273-284
- https://doi.org/10.1137/0405021
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A Zero-One Law for Boolean PrivacySIAM Journal on Discrete Mathematics, 1991
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Communication complexityJournal of Computer and System Sciences, 1984
- Protocols for secure computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982