ABY

ABY - a framework for efficient mixed-protocol secure two-party computation.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 8 articles )

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

  1. Heldmann, Tim; Schneider, Thomas; Tkachenko, Oleksandr; Weinert, Christian; Yalame, Hossein: LLVM-based circuit compilation for practical secure computation (2021)
  2. Sehrawat, Vipin Singh; Yeo, Foo Yee; Desmedt, Yvo: Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (2021)
  3. Alhassan, Masaud Y.; Günther, Daniel; Kiss, Ágnes; Schneider, Thomas: Efficient and scalable universal circuits (2020)
  4. Rathee, Deevashwer; Schneider, Thomas; Shukla, K. K.: Improved multiplication triple generation over rings via RLWE-based AHE (2019)
  5. Asharov, Gilad; Lindell, Yehuda; Schneider, Thomas; Zohner, Michael: More efficient oblivious transfer extensions (2017)
  6. Büscher, Niklas; Franz, Martin; Holzer, Andreas; Veith, Helmut; Katzenbeisser, Stefan: On compiling Boolean circuits optimized for secure multi-party computation (2017)
  7. Butler, David; Aspinall, David; Gascón, Adrià: How to simulate it in Isabelle: towards formal proof for secure multi-party computation (2017)
  8. Couteau, Geoffroy; Peters, Thomas; Pointcheval, David: Encryption switching protocols (2016)