A Zero-One Law for Boolean Privacy
From MaRDI portal
Recommendations
Cited in
(40)- Characterizing linear size circuits in terms of privacy
- On the structure of the privacy hierarchy
- Protecting data privacy in private information retrieval schemes
- Best possible information-theoretic MPC
- The privacy of dense symmetric functions
- On privacy and partition arguments
- Mathematical problems in cryptology
- On private computation in incomplete networks
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- On fully secure MPC with solitary output
- Lower and upper bounds on the randomness complexity of private computations of AND
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
- Completeness for symmetric two-party functionalities: revisited
- Privacy in non-private environments
- Fooling pairs in randomized communication complexity
- Limits on the usefulness of random oracles
- Black-box separations for differentially private protocols
- The hardness of being private
- A zero-one law for secure multi-party computation with ternary outputs
- On complete primitives for fairness
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- scientific article; zbMATH DE number 1256773 (Why is no real title available?)
- On the number of random bits in totally private computation
- scientific article; zbMATH DE number 826066 (Why is no real title available?)
- Reducibility and Completeness in Private Computations
- On the Communication Complexity of Key-Agreement Protocols.
- Cryptography and cryptographic protocols
- Quantifying the leakage of quantum protocols for classical two-party cryptography
- OT-Combiners via Secure Computation
- Susceptible Two-Party Quantum Computations
- Lower and upper bounds on the randomness complexity of private computations of AND
- On \(d\)-multiplicative secret sharing
- 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
- Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
- The round complexity of statistical MPC with optimal resiliency
- On communication protocols that compute almost privately
- Cryptography with weak privacy
This page was built for publication: A Zero-One Law for Boolean Privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5749233)
