Pinned Repositories
BaRK-OPRF
Efficient Batched Oblivious PRF with Applications to Private Set Intersection (CCS 2016)
ChaumPedersenZKP
The Chaum Pedersen proof system (i.e., proof of same exponent)
concord-bft
Concord byzantine fault tolerant state machine replication library
Fast-Polynomial-Interpolation-and-Evaluation
This is an implementation of the fast polynomial interpolation and evaluation of Borodin and Moenck paper from 1973.
FastPolynomial
libfqfft
C++ library for Fast Fourier Transforms in finite fields
libPSI
A repository for private set intersection.
PaillierLibrarySamples
Sample codes to work with the C++ Paillier Library (http://hms.isi.jhu.edu/acsc/libpaillier/).
research-grants
Protocol Labs Research Grants
scapi
The Secure Computation API
AvishayYanay's Repositories
AvishayYanay/concord-bft
Concord byzantine fault tolerant state machine replication library
AvishayYanay/FastPolynomial
AvishayYanay/scapi
The Secure Computation API
AvishayYanay/BaRK-OPRF
Efficient Batched Oblivious PRF with Applications to Private Set Intersection (CCS 2016)
AvishayYanay/ChaumPedersenZKP
The Chaum Pedersen proof system (i.e., proof of same exponent)
AvishayYanay/Fast-Polynomial-Interpolation-and-Evaluation
This is an implementation of the fast polynomial interpolation and evaluation of Borodin and Moenck paper from 1973.
AvishayYanay/libfqfft
C++ library for Fast Fourier Transforms in finite fields
AvishayYanay/libPSI
A repository for private set intersection.
AvishayYanay/PaillierLibrarySamples
Sample codes to work with the C++ Paillier Library (http://hms.isi.jhu.edu/acsc/libpaillier/).
AvishayYanay/research-grants
Protocol Labs Research Grants
AvishayYanay/SecureVoting