New Lower Bounds for Privacy in Communication Protocols
From MaRDI portal
Recommendations
- On communication protocols that compute almost privately
- On communication protocols that compute almost privately
- Communication and Randomness Lower Bounds for Secure Computation
- Privacy and Communication Complexity
- Lower bounds in differential privacy
- Lower bounds and new constructions on secure group communication schemes
- scientific article; zbMATH DE number 708804
- Lower bounds for oblivious single-packet end-to-end communication
- A tight lower bound for restricted PIR protocols
Cited in
(12)- An interactive information odometer and applications
- The hardness of being private
- Private interactive communication across an adversarial channel
- Privacy and Communication Complexity
- Privacy, additional information and communication
- scientific article; zbMATH DE number 2086397 (Why is no real title available?)
- Exponential Separations in Local Differential Privacy
- Revealing Additional Information in Two-Party Computations
- The communication complexity of private simultaneous messages, revisited
- Quantum and approximate privacy
- On communication protocols that compute almost privately
- Lower bounds and new constructions on secure group communication schemes
This page was built for publication: New Lower Bounds for Privacy in Communication Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948253)