Privacy in non-private environments

DOI10.1007/s00224-009-9243-1zbMath1208.94038OpenAlexW2149246616MaRDI QIDQ2429730

Maciej Liśkiewicz, Bodo Manthey, Markus Bläser, Andreas Jakoby

Publication date: 1 April 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9243-1

zbMATH Keywords

graph connectivitycommunication complexityrandomnesssecure function evaluationsecure multi-party computationprivate computation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Oblivious transfer in incomplete networks ⋮ Must the communication graph of MPC protocols be an expander?

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Private computation: \(k\)-connected versus 1-connected networks
• Characterizing linear size circuits in terms of privacy
• Communication protocols for secure distributed computation of binary functions.
• Privacy and Communication Complexity
• Communication complexity of secure distributed computation in the presence of noise
• Rounds in Communication Complexity Revisited
• Privacy, additional information and communication
• Private Computations over the Integers
• Communication Complexity
• Secure Hypergraphs: Privacy from Partial Broadcast
• A Zero-One Law for Boolean Privacy

This page was built for publication: Privacy in non-private environments