March 30, 2023, 1:10 a.m. | Roberto A. Machado, Welington Santos, Gretchen L. Matthews

cs.CR updates on arXiv.org arxiv.org

We consider the problem of secure distributed matrix multiplication (SDMM),
where a user has two matrices and wishes to compute their product with the help
of $N$ honest but curious servers under the security constraint that any
information about either $A$ or $B$ is not leaked to any server. This paper
presents anew scheme that considers the inner product partition for matrices
$A$ and $B$. Our central technique relies on encoding matrices $A$ and $B$ in a
Hermitian Code and …

code compute distributed encoding information leaked matrix problem product security server servers under

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Digital Trust Cyber Transformation Senior

@ KPMG India | Mumbai, Maharashtra, India

Security Consultant, Assessment Services - SOC 2 | Remote US

@ Coalfire | United States

Sr. Systems Security Engineer

@ Effectual | Washington, DC

Cyber Network Engineer

@ SonicWall | Woodbridge, Virginia, United States

Security Architect

@ Nokia | Belgium