Privacy in non-private environments
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- A Mathematical Theory of Communication
- A Zero-One Law for Boolean Privacy
- Characterizing linear size circuits in terms of privacy
- Communication Complexity
- Communication complexity of secure distributed computation in the presence of noise
- Communication protocols for secure distributed computation of binary functions.
- Privacy and Communication Complexity
- Privacy, additional information and communication
- Private Computations over the Integers
- Private computation: k-connected versus 1-connected networks
- Rounds in Communication Complexity Revisited
- Secure Hypergraphs: Privacy from Partial Broadcast
Cited in
(8)- Eavesdropping games
- scientific article; zbMATH DE number 1962743 (Why is no real title available?)
- Privacy in implementation
- Oblivious transfer in incomplete networks
- On crossroads of privacy protection
- Privacy in Non-private Environments
- Must the communication graph of MPC protocols be an expander?
- Privacy Amplification by Public Discussion
This page was built for publication: Privacy in non-private environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429730)