Open wellsaid opened 5 years ago
This probably a bug. When you do an AND, the secret for the AND node is distributed by generating a n+1-degree polynomial, where n is the number of children. I suppose x^15 overflows somewhere and messes up stuff. I need to check this.
Hello, I was trying to decrypt the secret with a "worst case" policy of all attributes in the universe in AND. See the code below:
The fact is that for more than 15 attributes in AND the library fails to decrypt the secret. The line:
cout << element_cmp(&secret, &recovered) << endl; // should be ==0
gives 1.
Is this a library limitation or a bug?