Data decoys for confidentiality in a distributed computation
Tobin Jackson, Delbert Hart · 2004
The confidentiality of a distributed computation can be compromised if trust in the client machines cannot be assured. Strategically placed decoy data can provide a measure of confidentiality to a distributed computation by overwhelming an attacker with the combinatorial problem of differentiating live data from decoy data. This paper explores the nature of using decoy data in general and considers the particular problem of using data decoys to provide confidentiality in a matrix multiplication distributed computation.