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

Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer

Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou

Published Jan 1, 2009• 54 citations
Publisher
DOI
10.1007/978-3-642-03356-8_30

Related papers

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

Adaptively Secure Oblivious Transfer

Donald Beaver

Lecture notes in computer science•Jan 1, 1998•14 citations

Efficient and Universally Composable Security Oblivious Transfer

Fenghua Li

Non-committing encryption achieved only semantic security,in contrast,applications often require security against chosen ciphertext attacks.A main ingredient in the previous adaptive universally composable(UC)oblivious transfer protocols are non-committing encryptions.the previous proposals are not UC secure against adaptive adversaries in the so-called non-erase model.A new UC secure oblivious transfer protocols were proposed and schemes utilize two primitives of the verifiably smooth projective hashing and deniable encryption as constructed by.the double trapdoor decryption mechanism based on trapdoor commitment.Our construction is based on the decisional composite residuosity in common reference string (CRS) model.We constructed a two-message(1-round) string oblivious transfer protocol,which improves computational efficient that supports message spaces of size exponential and save O(n)-1 rounds communications efficient than bit-OT protocols.

Dianzi xuebao•Jan 1, 2008•1 citation

Improved Non-committing Encryption with Applications to Adaptively Secure Protocols

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin +1 more

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

A Secure Protocol for the Oblivious Transfer (Extended Abstract)

Michael J. Fischer, Silvio M. Micali, Charles Rackoff

Journal of Cryptology•Jan 1, 1996•28 citations
Non-committing encryption achieved only semantic security,in contrast,applications often require security against chosen ciphertext attacks.A main ingredient in the previous adaptive universally composable(UC)oblivious transfer protocols are non-committing encryptions.the previous proposals are not UC secure against adaptive adversaries in the so-called non-erase model.A new UC secure oblivious transfer protocols were proposed and schemes utilize two primitives of the verifiably smooth projective hashing and deniable encryption as constructed by.the double trapdoor decryption mechanism based on trapdoor commitment.Our construction is based on the decisional composite residuosity in common reference string (CRS) model.We constructed a two-message(1-round) string oblivious transfer protocol,which improves computational efficient that supports message spaces of size exponential and save O(n)-1 rounds communications efficient than bit-OT protocols.
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.