frankw2 / libfss Goto Github PK

Hi,

I run the fss-test as it comes and did get the expected results. However, if I set a = 2 in line 8, I get:

FSS Eq No Match (should be 0): 2
FSS Lt Match (should be non-zero): 2
FSS Lt No Match (should be 0): 0
FSS Eq Multi-Party Match (should be non-zero): 2
FSS Eq Multi-Party No Match (should be 0): 0

which is incorrect. Are there any constraints on the points of the dpf in the implementation?

Thanks a lot for your work! :)

Adria

Hello, I found that there is no code for generateTreeLTMParty and evaluateLTMParty in the lib. Could the code for generateTreeLTMParty and evaluateLTMParty be public?

Server.go claims to contain the code for the client and Client.go claims to contain the code for the server.

In function evaluateEq, this particular line in the for loop requests getBit(x, 65) when i==n, causing this line to do the operation 1 << -1. Is this an intended behavior?

As in FSS in CCS, the max $m$ (without adding $z$ in Theorem 3.3) is 128-bit

https://cs.idc.ac.il/~elette/FSS-CCS.pdf

However, go language does not provide good support of 128-bit. In C++, like libgarble (https://github.com/amaloz/libgarble/blob/master/src/garble/block.h), some special techniques may help 128-bit integer.

WIll the C++ version supports up to m=128 in C++ version?

Hello, I found that there is no code for generateTreeLTMParty and evaluateLTMParty in the lib. Could the code for generateTreeLTMParty and evaluateLTMParty be public?