This repository is for testing ideas about secure multi-party computation ideas for the PVS project.
- Implementation to understand the operating principles of ABY3, a secure 3-party computation protocol that allows addition, multiplication by a constant, and subtraction of secrets without communication between parties. Also, it allows the multiplication of secrets with O(1) communication between parties, and the same is true for dot product operations.
- An implementation for testing ideas for the computation of the Manhattan distance between codes in an SMPC setting. This approach is proposed to avoid the binary conversion of codes for the secure comparison of codes. This idea is for the sake of speeding up the comparison process in the SMPC setting.