Communication protocols for secure distributed computation of binary functions.

DOI10.1006/INCO.2000.2865zbMath1046.68502OpenAlexW2031252726MaRDI QIDQ1854343

Anthony Ephremides, Eytan H. Modiano

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5dab3b579b7a4c5add6e32446f0f01864b5963a8

zbMATH Keywords

eavesdropper

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (1)

Privacy in non-private environments

Cites Work

• Enlarging the region of convergence of Newton's method for constrained optimization
• Average and randomized communication complexity
• Communication complexity of secure distributed computation in the presence of noise

This page was built for publication: Communication protocols for secure distributed computation of binary functions.