JustGarble
From MaRDI portal
Software:35007
swMATH23223MaRDI QIDQ35007FDOQ35007
Author name not available (Why is that?)
Cited In (14)
- How to circumvent the two-ciphertext lower bound for linear garbling schemes
- Fast garbling of circuits under standard assumptions
- Linicrypt: a model for practical cryptography
- Network oblivious transfer
- Privacy-preserving \(k\)-nearest neighbour query on outsourced database
- Garbled circuits as randomized encodings of functions: a primer
- Public-seed pseudorandom permutations
- Faster secure two-party computation in the single-execution setting
- High-precision secure computation of satellite collision probabilities
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
- More efficient constant-round multi-party computation from BMR and SHE
- Hashing garbled circuits for free
- More efficient oblivious transfer extensions
- On compiling Boolean circuits optimized for secure multi-party computation
This page was built for software: JustGarble
