swMATH23224MaRDI QIDQ35008FDOQ35008
Author name not available (Why is that?)
Official website: https://link.springer.com/chapter/10.1007%2F978-3-662-44381-1_25
Cited In (20)
- FINAL
- How to circumvent the two-ciphertext lower bound for linear garbling schemes
- Fast garbling of circuits under standard assumptions
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Linicrypt: a model for practical cryptography
- Garbled circuits as randomized encodings of functions: a primer
- CrypTFlow2
- Faster secure two-party computation in the single-execution setting
- Non-interactive secure 2PC in the offline/online and batch settings
- TinyKeys: a new approach to efficient multi-party computation
- MiniLEGO
- TASTY
- FairplayMP
- JustGarble
- libgarble
- EMP-toolkit
- ObliVM
- Garbled circuits with sublinear evaluator
- Hashing garbled circuits for free
- Obliv-C
This page was built for software: FleXOR
