We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
请问《Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps》的F_2实现是在下面这个文件中吗? /mpc4j/mpc4j-crypto-matrix/src/main/java/edu/alibaba/mpc4j/crypto/matrix/okve/tool/BinaryBandLinearSolver.java
The text was updated successfully, but these errors were encountered:
这个实现从功能角度上是正确的,但存储量是O(n^2),因此需要进一步优化。
Sorry, something went wrong.
因为我们这个实现还不完整(虽然功能是对的,但内存消耗比论文中的大),因此我们没有在README里面声称我们实现了《Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps》这篇论文。
我们计划在下一个版本(v1.1.1)把BinaryBandLinearSolver完整实现完,从而完成《Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps》这篇论文的实现。实现完毕后我会回复并关闭此issue。
我们在新上传的1.1.1版本里已更新了内存开销优化后的BinaryBandLinearSolver.java,参见:https://github.com/alibaba-edu/mpc4j/blob/main/mpc4j-common-structure/src/main/java/edu/alibaba/mpc4j/common/structure/okve/tool/BinaryBandLinearSolver.java。
No branches or pull requests
请问《Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps》的F_2实现是在下面这个文件中吗?
/mpc4j/mpc4j-crypto-matrix/src/main/java/edu/alibaba/mpc4j/crypto/matrix/okve/tool/BinaryBandLinearSolver.java
The text was updated successfully, but these errors were encountered: