The following pages link to JustGarble (Q35007):
Displayed 14 items.
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack (Q2195311) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database (Q2817461) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- Public-Seed Pseudorandom Permutations (Q5738982) (← links)