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

A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement

Daniele Friolo, Daniel Masny, Daniele Venturi

Published Jan 1, 2019• 20 citations
Publisher
DOI
10.1007/978-3-030-36030-6_5

Related papers

Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols

Huafei Zhu

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

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

Arpita Patra, Akshayaram Srinivasan

Lecture notes in computer science•Jan 1, 2021•11 citations

A Fully Simulatable Oblivious Transfer Scheme Using Vector Decomposition

Manoj Kumar, I. Praveen

Advances in intelligent systems and computing•Aug 28, 2014•4 citations

Efficient Fully-Simulatable Oblivious Transfer

Andrew Y. Lindell

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

Practical Fully Simulatable Oblivious Transfer with Sublinear Communication

Bingsheng Zhang, Helger Lipmaa, Cong Wang +1 more

Lecture notes in computer science•Jan 1, 2013•9 citations

List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Lecture notes in computer science•Jan 1, 2023•4 citations