A cost-preserving transformation enforces information-theoretic secrecy in distributed computing via null-space augmentation of the allocation matrix and shared randomness injection.
Tessellated distributed computing
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2representative citing papers
The GMUDC framework provides topology-aware upper and lower bounds on reconstruction risk for nonlinear functions in RKHS under per-server computation and communication budgets in both quenched and annealed regimes.
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.