Achieves lower convex hull of (N/(K-1), (K/(K-1)) * sum_{i=0 to M-1} (K/N)^i) pairs for K=2..N in secure private matrix multiplication over N servers.
Private function retrieval,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Upload versus Download Cost for Secure and Private Matrix Multiplication
Achieves lower convex hull of (N/(K-1), (K/(K-1)) * sum_{i=0 to M-1} (K/N)^i) pairs for K=2..N in secure private matrix multiplication over N servers.