A Zero-One Law for Boolean Privacy
From MaRDI portal
Publication:5749233
DOI10.1137/0404004zbMath0717.94009OpenAlexW1984332407MaRDI QIDQ5749233
Publication date: 1991
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3f39a74106863f7d09da370bf0a30664367c5286
Related Items
Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Limits on the usefulness of random oracles ⋮ Best possible information-theoretic MPC ⋮ Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption ⋮ A discrepancy lower bound for information complexity ⋮ Mathematical problems in cryptology ⋮ On fully secure MPC with solitary output ⋮ Lower and upper bounds on the randomness complexity of private computations of AND ⋮ On \(d\)-multiplicative secret sharing ⋮ Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation ⋮ The Hardness of Being Private ⋮ Completeness for symmetric two-party functionalities: revisited ⋮ Random sources in private computation ⋮ On perfectly secure two-party computation for symmetric functionalities with correlated randomness ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ Privacy in non-private environments ⋮ On private computation in incomplete networks ⋮ Cryptography and cryptographic protocols ⋮ 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 ⋮ OT-Combiners via Secure Computation ⋮ On the Communication Complexity of Key-Agreement Protocols. ⋮ Fooling Pairs in Randomized Communication Complexity ⋮ On Complete Primitives for Fairness ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Protecting data privacy in private information retrieval schemes ⋮ Susceptible Two-Party Quantum Computations ⋮ The privacy of dense symmetric functions ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND ⋮ 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: A Zero-One Law for Boolean Privacy
