Privacy and Communication Complexity

DOI10.1137/0405021MaRDI QIDQ4012449zbMATH OpenFDO

Authors Eyal Kushilevitz

Publication date 27 September 1992

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0405021

zbMATH Keywords

deterministic protocolmultiparty private protocolsprivate distributed computationsprivately computable functionrounds complexityunication complexity

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Information theory (general) (94A15) Cryptography (94A60)

Recommendations

• Private Computations over the Integers
• Randomness complexity of private computation
• New Lower Bounds for Privacy in Communication Protocols
• Privacy, additional information and communication
• A Randomness-Rounds Tradeoff in Private Computation

Cited in

(32)

• Characterizing linear size circuits in terms of privacy
• On the structure of the privacy hierarchy
• Protecting data privacy in private information retrieval schemes
• Another step towards realizing random oracles: non-malleable point obfuscation
• The privacy of dense symmetric functions
• On privacy and partition arguments
• On private computation in incomplete networks
• Upper bounds on the Boolean rank of Kronecker products
• On fully secure MPC with solitary output
• 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
• Privacy in non-private environments
• A theorem on sensitivity and applications in private computation
• On the communication required for unconditionally secure multiplication
• Computing (and Life) Is All about Tradeoffs
• New Lower Bounds for Privacy in Communication Protocols
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Zero-information protocols and unambiguity in Arthur-Merlin communication
• Resolving the Complexity of Some Data Privacy Problems
• scientific article; zbMATH DE number 1256773 (Why is no real title available?)
• Privacy, additional information and communication
• Multi-party protocols, information complexity and privacy
• On the number of random bits in totally private computation
• Exponential Separations in Local Differential Privacy
• Quantifying the leakage of quantum protocols for classical two-party cryptography
• Multi-Party Protocols, Information Complexity and Privacy
• Susceptible Two-Party Quantum Computations
• On \(d\)-multiplicative secret sharing
• On perfectly secure two-party computation for symmetric functionalities with correlated randomness
• Quantum and approximate privacy
• On communication protocols that compute almost privately
• Cryptography with weak privacy

This page was built for publication: Privacy and Communication Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012449)