Media Summary: Paper by Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs presented at Eurocrypt 2020 See ... Paper by Arpita Patra, Akshayaram Srinivasan presented at Crypto 2021 See ... Paper by Pedro Branco, Nico Döttling, Paulo Mateus presented at PKC 2022 See ...

Two Round Oblivious Transfer From - Detailed Analysis & Overview

Paper by Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs presented at Eurocrypt 2020 See ... Paper by Arpita Patra, Akshayaram Srinivasan presented at Crypto 2021 See ... Paper by Pedro Branco, Nico Döttling, Paulo Mateus presented at PKC 2022 See ... ... a construction of round-optimal secure multiparty computation from the minimal assumption that Paper by Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky presented at TCC 2021 See ... Paper by Carmit Hazay and Peter Scholl and Eduardo Soria-Vazquez, presented at Asiacrypt 2017.

Presenter: David Butler Presented at CPP'20, located at POPL 2020. Daniel Wichs, Northeastern University Securing Computation Ranjit Kumaresan and Srinivasan Raghuraman and Adam Sealfon, Crypto 2016. Paper by Sanjam Garg and Peihan Miao and Akshayaram Srinivasan, presented at Crypto 2018.

Photo Gallery

Two-Round Oblivious Transfer from CDH or LPN
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
Two-Round Oblivious Linear Evaluation from Learning with Errors
Two-round Secure Multiparty Computations from Minimal Assumptions
1-2 Oblivious Transfer
Three Round Secure Multiparty Computation from Black Box Two Round Oblivious Transfer - Arpita Patra
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
Formalising Oblivious Transfer in CryptHOL
Two Round MPC via Multi-Key FHE
Network Oblivious Transfer
Oblivious Transfer
View Detailed Profile
Two-Round Oblivious Transfer from CDH or LPN

Two-Round Oblivious Transfer from CDH or LPN

Paper by Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs presented at Eurocrypt 2020 See ...

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Paper by Arpita Patra, Akshayaram Srinivasan presented at Crypto 2021 See ...

Two-Round Oblivious Linear Evaluation from Learning with Errors

Two-Round Oblivious Linear Evaluation from Learning with Errors

Paper by Pedro Branco, Nico Döttling, Paulo Mateus presented at PKC 2022 See ...

Two-round Secure Multiparty Computations from Minimal Assumptions

Two-round Secure Multiparty Computations from Minimal Assumptions

... a construction of round-optimal secure multiparty computation from the minimal assumption that

1-2 Oblivious Transfer

1-2 Oblivious Transfer

Can Alice

Three Round Secure Multiparty Computation from Black Box Two Round Oblivious Transfer - Arpita Patra

Three Round Secure Multiparty Computation from Black Box Two Round Oblivious Transfer - Arpita Patra

We give constructions of three-

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds

Paper by Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky presented at TCC 2021 See ...

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Paper by Carmit Hazay and Peter Scholl and Eduardo Soria-Vazquez, presented at Asiacrypt 2017.

Formalising Oblivious Transfer in CryptHOL

Formalising Oblivious Transfer in CryptHOL

Presenter: David Butler Presented at CPP'20, located at POPL 2020.

Two Round MPC via Multi-Key FHE

Two Round MPC via Multi-Key FHE

Daniel Wichs, Northeastern University Securing Computation http://simons.berkeley.edu/talks/daniel-wichs-2015-06-12.

Network Oblivious Transfer

Network Oblivious Transfer

Ranjit Kumaresan and Srinivasan Raghuraman and Adam Sealfon, Crypto 2016.

Oblivious Transfer

Oblivious Transfer

http://asecuritysite.com/encryption/ot.

Two Round Multiparty Secure Computation Minimizing Public Key Operations

Two Round Multiparty Secure Computation Minimizing Public Key Operations

Paper by Sanjam Garg and Peihan Miao and Akshayaram Srinivasan, presented at Crypto 2018.