References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Gao, Chong-zhi; Cheng, Qiong; He, Pei; Susilo, Willy; Li, Jin: Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack (2018)
  2. Gueron, Shay; Lindell, Yehuda; Nof, Ariel; Pinkas, Benny: Fast garbling of circuits under standard assumptions (2018)
  3. Applebaum, Benny: Garbled circuits as randomized encodings of functions: a primer (2017)
  4. Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael: More efficient oblivious transfer extensions (2017)
  5. B├╝scher, Niklas; Franz, Martin; Holzer, Andreas; Veith, Helmut; Katzenbeisser, Stefan: On compiling Boolean circuits optimized for secure multi-party computation (2017)
  6. Fan, Xiong; Ganesh, Chaya; Kolesnikov, Vladimir: Hashing garbled circuits for free (2017)
  7. Soni, Pratik; Tessaro, Stefano: Public-seed pseudorandom permutations (2017)
  8. Wang, Xiao; Malozemoff, Alex J.; Katz, Jonathan: Faster secure two-party computation in the single-execution setting (2017)
  9. Carmer, Brent; Rosulek, Mike: Linicrypt: a model for practical cryptography (2016)
  10. Hemenway, Brett; Lu, Steve; Ostrovsky, Rafail; Welser, William IV: High-precision secure computation of satellite collision probabilities (2016)
  11. Kempka, Carmen; Kikuchi, Ryo; Suzuki, Koutarou: How to circumvent the two-ciphertext lower bound for linear garbling schemes (2016)
  12. Kumaresan, Ranjit; Raghuraman, Srinivasan; Sealfon, Adam: Network oblivious transfer (2016)
  13. Lindell, Yehuda; Smart, Nigel P.; Soria-Vazquez, Eduardo: More efficient constant-round multi-party computation from BMR and SHE (2016)
  14. Xu, Rui; Morozov, Kirill; Yang, Yanjiang; Zhou, Jianying; Takagi, Tsuyoshi: Privacy-preserving (k)-nearest neighbour query on outsourced database (2016)