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

Efficient Adaptive Oblivious Transfer in UC Framework

Vandana Guleria, Ratna Dutta

Published Jan 1, 2014• 5 citations
Publisher
DOI
10.1007/978-3-319-06320-1_21

Related papers

Efficient Adaptive Oblivious Transfer Without q-type Assumptions in UC Framework

Vandana Guleria, Ratna Dutta

Lecture notes in computer science•Jan 1, 2015•1 citation

A Framework for Efficient and Composable Oblivious Transfer

Chris Peikert, Vinod Vaikuntanathan, Brent R. Waters

Lecture notes in computer science•Aug 20, 2008•684 citations

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

Ran Canetti, Pratik Sarkar, Xiao Shaun Wang

Lecture notes in computer science•Jan 1, 2020•18 citations

Efficient k-Out-of-n Oblivious Transfer Schemes with Adaptive and Non-adaptive Queries

Cheng‐Kang Chu, Wen-Guey Tzeng

Lecture notes in computer science•Jan 1, 2005•119 citations

Universally composable oblivious transfer protocol based on VSPH

Jianfeng Ma

A new oblivious transfer protocol was proposed within the framework of universally composable security（UC-DT）.The protocol based on the verifiably smooth projective hashing（VSPH） is against adaptive adversaries in a common reference string（CRS） model.The UC-OT protocol improves computational efficiency with non-committing encryptions（NCE）which is based on decisional compounding residuosity,achieves UC-OT,and it saves O（n）-1 rounds in communication efficiency than bit-OT protocols.Compared with Canetti’s scheme in non-erase model,the message reduced once.Compared with Fischlin’s scheme,the message transfers were reduced twice,and the scheme does not rely on the auxiliary party,therefore it is more practical.

Journal of Communications•Jan 1, 2007•0 citations

Simulatable Adaptive Oblivious Transfer

Jan L. Camenisch, Gregory Neven, Abhi A. Shelat

Lecture notes in computer science•Jan 1, 2007•228 citations
A new oblivious transfer protocol was proposed within the framework of universally composable security（UC-DT）.The protocol based on the verifiably smooth projective hashing（VSPH） is against adaptive adversaries in a common reference string（CRS） model.The UC-OT protocol improves computational efficiency with non-committing encryptions（NCE）which is based on decisional compounding residuosity,achieves UC-OT,and it saves O（n）-1 rounds in communication efficiency than bit-OT protocols.Compared with Canetti’s scheme in non-erase model,the message reduced once.Compared with Fischlin’s scheme,the message transfers were reduced twice,and the scheme does not rely on the auxiliary party,therefore it is more practical.