Privacy and Communication Complexity
From MaRDI portal
Publication:4012449
DOI10.1137/0405021zbMath0753.94006MaRDI QIDQ4012449
Publication date: 27 September 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
deterministic protocol; private distributed computations; multiparty private protocols; privately computable function; rounds complexity; unication complexity
Related Items
Susceptible Two-Party Quantum Computations, On \(d\)-multiplicative secret sharing, On communication protocols that compute almost privately, Characterizing linear size circuits in terms of privacy, On the structure of the privacy hierarchy, Protecting data privacy in private information retrieval schemes, The privacy of dense symmetric functions, On privacy and partition arguments, On private computation in incomplete networks, Privacy in non-private environments, Computing (and Life) Is All about Tradeoffs, Founding Cryptography on Tamper-Proof Hardware Tokens