Communication protocols for secure distributed computation of binary functions.

DOI10.1006/INCO.2000.2865zbMATH Open1046.68502OpenAlexW2031252726MaRDI QIDQ1854343FDOQ1854343

Anthony Ephremides, Eytan 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

Recommendations

• Communication complexity of secure distributed computation in the presence of noise
• scientific article; zbMATH DE number 826070
• Private Computations over the Integers
• On private computation in incomplete networks
• Communication preserving protocols for secure function evaluation

zbMATH Keywords

eavesdropper

Mathematics Subject Classification ID

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

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

Cited In (5)

• Communication preserving protocols for secure function evaluation
• Summing over a network without revealing summands
• Privacy in non-private environments
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854343)