Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds

Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky

Published Jan 1, 2021• 10 citations
Publisher
DOI
10.1007/978-3-030-90453-1_18

Related papers

Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations

Iftach Haitner

Lecture notes in computer science•Jan 1, 2004•49 citations

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2017•27 citations

Weak Oblivious Transfer from Strong One-Way Permutations

圭介 田中, Keisuke Tanaka, 章央 山田 +3 more

•Jan 1, 2010•0 citations

Round Optimal Universally Composable Oblivious Transfer Protocols

Huafei Zhu

Lecture notes in computer science•Jan 1, 2008•3 citations

Constant-Round Oblivious Transfer in the Bounded Storage Model

Yan Zong Ding, Danny Harnik, Alon Rosen +1 more

Lecture notes in computer science•Jan 1, 2004•81 citations

Constant-Round Oblivious Transfer in the Bounded Storage Model

Yan Zong Ding, Danny Harnik, Alon Rosen +1 more

Journal of Cryptology•Mar 20, 2007•27 citations