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

Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols

Huafei Zhu

Published Jan 1, 2008• 0 citations
Publisher
DOI
10.1007/978-3-540-89641-8_15

Related papers

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

Daniele Friolo, Daniel Masny, Daniele Venturi

Lecture notes in computer science•Jan 1, 2019•21 citations

Efficient Fully-Simulatable Oblivious Transfer

Andrew Y. Lindell

Lecture notes in computer science•Jan 1, 2008•65 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

Generic Fully Simulatable Adaptive Oblivious Transfer

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong

Lecture notes in computer science•Jan 1, 2011•18 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 Oblivious Transfer Protocols based on White-Box Cryptography.

Aram Jivanyan, Gurgen Khachatryan, Andriy Oliynyk +1 more

•Jan 1, 2016•5 citations