A cost-preserving transformation enforces information-theoretic secrecy in distributed computing via null-space augmentation of the allocation matrix and shared randomness injection.
Lagrange coded computing: Optimal design for resiliency, security, and privacy
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 2years
2026 2roles
background 1polarities
background 1representative citing papers
A new BCSFR algorithm uses characteristic sets to characterize full-rank equivalence conditions for binary symbolic matrices as zeros of triangular sets, enabling simpler optimization of linear coding schemes.
citing papers explorer
-
Secure Multi-User Linearly-Separable Distributed Computing
A cost-preserving transformation enforces information-theoretic secrecy in distributed computing via null-space augmentation of the allocation matrix and shared randomness injection.
-
An Algebraic Method for Full-Rank Characterization in Binary Linear Coding
A new BCSFR algorithm uses characteristic sets to characterize full-rank equivalence conditions for binary symbolic matrices as zeros of triangular sets, enabling simpler optimization of linear coding schemes.