On private computation in incomplete networks

DOI10.1007/s00446-006-0010-0zbMath1266.68046OpenAlexW2033679620MaRDI QIDQ1954202

Amos Beimel

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-006-0010-0

zbMATH Keywords

connectivityprivate computationincomplete communication networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)

Related Items (3)

Oblivious transfer in incomplete networks ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Must the communication graph of MPC protocols be an expander?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Easy impossibility proofs for distributed consensus problems
• Reliable communication over partially authenticated networks
• Tolerating a linear number of faults in networks of bounded degree
• Efficient perfectly secure message transmission in synchronous networks
• Secure communication in minimal connectivity models
• Player simulation and general adversary structures in perfect multiparty computation
• Security and composition of multiparty cryptographic protocols
• Fault Tolerance in Networks of Bounded Degree
• The Byzantine generals strike again
• Privacy and Communication Complexity
• Perfectly secure message transmission
• Fault-tolerant Computation in the Full Information Model
• On perfectly secure communication over arbitrary networks
• Advances in Cryptology – CRYPTO 2004
• Privacy in Non-private Environments
• A Zero-One Law for Boolean Privacy
• Efficient reliable communication over partially authenticated networks
• Secure communication in multicast channels: The answer to Franklin and Wright's question

This page was built for publication: On private computation in incomplete networks