multipartypsi's Issues
The problem with too large OT masks
understand and fix why all the methods fail once the OT masks are too large (this problem affect inverse-naive method)
Use Cxxprof
This framework could enable to show the time it took for smaller steps to occur
remove the random inside the bloom filter
join once every time to add more threads
check if size of bloom filter is multiplied by num bytes or num bits
add random values in the empty cells of the GBF
right now it has zeros in the empty cells so it is not secure.
Instead of calling RAND_Bytes every time it is better to use AES_PRG since making random is a costly operation
Fix crypto destructor
It caused a crash so I put the free calls in the crypto destructor in comment.
debug why it happens and return the free calls
create hashed Polynomials in several threads
The polynomials methods don't return the exact correct solution
make the num of OT Extension parallel at will
support the use of stash in cuckoo hashing
zohner and co. wrote a code that supports a stash in the cuckoo hashing but their code had bugs so they commented it out.
fix the bug and support it in all the methods
use gf2x library to accelerate work with it
understand why sometimes the real result is not like the published. problem with the analysis ?
use AES in the OT Extension instead of SHA-512
add a way to know how much time spent on send/recv
correct value of maxBinSize
check what is the correct value and change it appropriately in the code
isElementsinset in several threads
numThreads in OT makes the result inaccurate
solve the bug in SIMPLE_HASH_GAUSS
It seems that if not random values are handed then but some correlated values then simple hash gauss fails. The problem probably lies with the CRF not doing its work properly.
This problem should be solved.
A temporary action that was taken was to domain hash all the elements in each of the parties. this solution doesn't add to time since it is in the constructor.
Carry Less multiplication
check whether GF2E supports it by default.
If not use Aner code to support it and make the polynomials methods faster
make the OT extension phase use num_of_runs
make the sending of polynomials hash faster
fix simplehashingnaivefollower to send one chunk only
fix the parallelization of Bloom filter
make its num_cores function to work again
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. ๐๐๐
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google โค๏ธ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.