Cited in
(40)- Wysteria
- 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
- High-precision secure computation of satellite collision probabilities
- Faster secure two-party computation in the single-execution setting
- Public-seed pseudorandom permutations
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
- VIFF
- MiniLEGO
- TASTY
- FairplayMP
- VMCrypt
- SHIELD
- Sharemind
- SCAPI
- FleXOR
- libgarble
- EMP-toolkit
- ObliVM
- ABY
- Gazelle
- More efficient constant-round multi-party computation from BMR and SHE
- Prio+
- EzPC
- Silver
- Hashing garbled circuits for free
- Callisto
- Rowhammer.js
- HyCC
- Obliv-C
- MP-SPDZ
- TinyGarble
- More efficient oblivious transfer extensions
- On compiling Boolean circuits optimized for secure multi-party computation
- Frigate
- CrypTFlow2
This page was built for software: JustGarble
