New Lower Bounds for Privacy in Communication Protocols
From MaRDI portal
Publication:2948253
DOI10.1007/978-3-319-04268-8_5zbMATH Open1395.94293OpenAlexW1254635718MaRDI QIDQ2948253FDOQ2948253
Authors: Iordanis Kerenidis, Mathieu Laurière, David Xiao 
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04268-8_5
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
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (10)
- Lower bounds and new constructions on secure group communication schemes
- On communication protocols that compute almost privately
- The communication complexity of private simultaneous messages, revisited
- Revealing Additional Information in Two-Party Computations
- Privacy and Communication Complexity
- Private interactive communication across an adversarial channel
- Title not available (Why is that?)
- Quantum and approximate privacy
- An interactive information odometer and applications
- The hardness of being private
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)
