TASTY: Tool for Automating Secure Two-partY computations. Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the outcome. Existing cryptographic compilers can automatically generate secure computation protocols from high-level specifications, but are often limited in their use and efficiency of generated protocols as they are based on either garbled circuits or (additively) homomorphic encryption only. In this paper we present TASTY, a novel tool for automating, i.e., describing, generating, executing, benchmarking, and comparing, efficient secure two-party computation protocols. TASTY is a new compiler that can generate protocols based on homomorphic encryption and efficient garbled circuits as well as combinations of both, which often yields the most efficient protocols available today. The user provides a high-level description of the computations to be performed on encrypted data in a domain-specific language. This is automatically transformed into a protocol. TASTY provides most recent techniques and optimizations for practical secure two-party computation with low online latency. Moreover, it allows to efficiently evaluate circuits generated by the well-known Fairplay compiler. We use TASTY to compare protocols for secure multiplication based on homomorphic encryption with those based on garbled circuits and highly efficient Karatsuba multiplication. Further, we show how TASTY improves the online latency for securely evaluating the AES functionality by an order of magnitude compared to previous software implementations. TASTY allows to automatically generate efficient secure protocols for many privacy-preserving applications where we consider the use cases for private set intersection and face recognition protocols.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 20 articles )

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

  1. Burra, Sai Sheshank; Larraia, Enrique; Nielsen, Jesper Buus; Nordholt, Peter Sebastian; Orlandi, Claudio; Orsini, Emmanuela; Scholl, Peter; Smart, Nigel P.: High-performance multi-party computation for binary circuits based on oblivious transfer (2021)
  2. Heldmann, Tim; Schneider, Thomas; Tkachenko, Oleksandr; Weinert, Christian; Yalame, Hossein: LLVM-based circuit compilation for practical secure computation (2021)
  3. Li, Ruinian; Xiao, Yinhao; Zhang, Cheng; Song, Tianyi; Hu, Chunqiang: Cryptographic algorithms for privacy-preserving online applications (2018)
  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. Applebaum, Benny: Garbling XOR gates “for free” in the standard model (2016)
  7. Couteau, Geoffroy; Peters, Thomas; Pointcheval, David: Encryption switching protocols (2016)
  8. Dagdelen, Özgür; Mohassel, Payman; Venturi, Daniele: Rate-limited secure function evaluation (2016)
  9. Jäschke, Angela; Armknecht, Frederik: Accelerating homomorphic computations on rational numbers (2016)
  10. Frederiksen, Tore Kasper; Jakobsen, Thomas P.; Nielsen, Jesper Buus: Faster maliciously secure two-party computation using the GPU (2014)
  11. Kamara, Seny; Mohassel, Payman; Raykova, Mariana; Sadeghian, Saeed: Scaling private set intersection to billion-element sets (2014) ioport
  12. Kerschbaum, Florian; Schneider, Thomas; Schröpfer, Axel: Automatic protocol selection in secure two-party computations (2014)
  13. Frederiksen, Tore Kasper; Jakobsen, Thomas Pelle; Nielsen, Jesper Buus; Nordholt, Peter Sebastian; Orlandi, Claudio: MiniLEGO: efficient secure two-party computation from general assumptions (2013)
  14. Huang, Yan; Katz, Jonathan; Evans, David: Efficient secure two-party computation using symmetric cut-and-choose (2013)
  15. Choi, Seung Geol; Hwang, Kyung-Wook; Katz, Jonathan; Malkin, Tal; Rubenstein, Dan: Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces (2012)
  16. Damgård, Ivan; Keller, Marcel; Larraia, Enrique; Miles, Christian; Smart, Nigel P.: Implementing AES via an actively/covertly secure dishonest-majority MPC protocol (2012)
  17. Mohassel, Payman; Niksefat, Salman; Sadeghian, Saeed; Sadeghiyan, Babak: An efficient protocol for oblivious DFA evaluation and applications (2012)
  18. Nielsen, Jesper Buus; Nordholt, Peter Sebastian; Orlandi, Claudio; Burra, Sai Sheshank: A new approach to practical active-secure two-party computation (2012)
  19. Ateniese, Giuseppe; De Cristofaro, Emiliano; Tsudik, Gene: (If) size matters: size-hiding private set intersection (2011)
  20. Katz, Jonathan; Malka, Lior: Constant-round private function evaluation with linear complexity (2011)