JustGarble
From MaRDI portal
Software:35007
swMATH23223MaRDI QIDQ35007FDOQ35007
Author name not available (Why is that?)
Cited In (14)
- Faster Secure Two-Party Computation in the Single-Execution Setting
- Fast garbling of circuits under standard assumptions
- Public-Seed Pseudorandom Permutations
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
- Hashing Garbled Circuits for Free
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
- Linicrypt: A Model for Practical Cryptography
- Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database
- Network Oblivious Transfer
- High-Precision Secure Computation of Satellite Collision Probabilities
- More efficient oblivious transfer extensions
- On compiling Boolean circuits optimized for secure multi-party computation
- More Efficient Constant-Round Multi-party Computation from BMR and SHE
- Garbled Circuits as Randomized Encodings of Functions: a Primer
This page was built for software: JustGarble
