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 protocolprivate distributed computationsmultiparty private protocolsprivately computable functionrounds complexityunication complexity
Related Items (22)
Upper bounds on the Boolean rank of Kronecker products ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ On fully secure MPC with solitary output ⋮ On \(d\)-multiplicative secret sharing ⋮ Completeness for symmetric two-party functionalities: revisited ⋮ On the computational complexities of three problems related to a privacy measure for large networks under active attack ⋮ On perfectly secure two-party computation for symmetric functionalities with correlated randomness ⋮ Privacy in non-private environments ⋮ On private computation in incomplete networks ⋮ On the number of random bits in totally private computation ⋮ Quantifying the leakage of quantum protocols for classical two-party cryptography ⋮ On communication protocols that compute almost privately ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Protecting data privacy in private information retrieval schemes ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Susceptible Two-Party Quantum Computations ⋮ The privacy of dense symmetric functions ⋮ Characterizing linear size circuits in terms of privacy ⋮ On privacy and partition arguments ⋮ On the structure of the privacy hierarchy
This page was built for publication: Privacy and Communication Complexity
